Question

Determining the number of solutions of the equation $y^2 = x^3 + x^2 + 5$ in $\mathbb{Z}/p^k \mathbb{Z}$ in function of $k$.

score 52 · Answer 1 · 2014-06-15 10:44:32

52

Views

Determining the number of solutions of the equation $y^2 = x^3 + x^2 + 5$ in $\mathbb{Z}/p^k \mathbb{Z}$ in function of $k$.

Published on 15 Jun 2014 - 10:44

score 19.2k · Answer 2 · 2014-06-21 09:58:11

19.2k

Views

How to solve this congruence $17x \equiv 1 \pmod{23}$?

Published on 21 Jun 2014 - 9:58

score 1.7k · Answer 3 · 2026-03-25 04:40:58

1.7k

Views

What is the interpretation of $a \equiv b$ mod $H$ in group theory?

Published on 25 Mar 2026 - 4:40

score 286 · Answer 4 · 2014-06-28 11:50:12

286

Views

Solving congruences

Published on 28 Jun 2014 - 11:50

score 123 · Answer 5 · 2014-06-29 11:47:50

123

Views

$A^7 \not\equiv A \pmod{13}$ implies $A^{78} + 1 \equiv 0 \pmod{169}$

Published on 29 Jun 2014 - 11:47

score 963 · Answer 6 · 2014-07-02 13:42:07

963

Views

Finding the smallest $x$ given a set of congruence conditions.

Published on 02 Jul 2014 - 13:42

score 515 · Answer 7 · 2014-07-05 16:43:05

515

Views

Modular Arithmatic - Solving congruences

Published on 05 Jul 2014 - 16:43

score 295 · Answer 8 · 2014-07-06 06:59:37

295

Views

Chinese remainder problem

Published on 06 Jul 2014 - 6:59

score 96 · Answer 9 · 2014-07-13 18:06:06

96

Views

Having trouble with Chinese Remainder Theorem

Published on 13 Jul 2014 - 18:06

score 101 · Answer 10 · 2014-07-15 04:30:48

101

Views

Suppose that $m \ge 0$ show that $49 \mid 5\cdot3^{4m + 2} + 53\cdot2^{5m}$

Published on 15 Jul 2014 - 4:30

score 111 · Answer 11 · 2014-07-17 03:20:27

111

Views

factoring polynomials in $\Bbb Z/11\Bbb Z$

Published on 17 Jul 2014 - 3:20

score 121 · Answer 12 · 2014-07-18 16:47:15

121

Views

How to solve system of congruence?

Published on 18 Jul 2014 - 16:47

score 4.8k · Answer 13 · 2014-07-19 00:26:26

4.8k

Views

Prove that if $n$ is not divisible by $5$, then $n^4 \equiv 1 \pmod{5}$

Published on 19 Jul 2014 - 0:26

score 55 · Answer 14 · 2014-07-21 14:12:56

55

Views

Prove that $l = k/\gcd(m,k)$.

Published on 21 Jul 2014 - 14:12

score 48 · Answer 15 · 2014-07-23 08:03:51

48

Views

Can we say If q is incongruent to p modulo n then $q\equiv -p$ (mod n)

Published on 23 Jul 2014 - 8:03

List Question

Determining the number of solutions of the equation $y^2 = x^3 + x^2 + 5$ in $\mathbb{Z}/p^k \mathbb{Z}$ in function of $k$.

How to solve this congruence $17x \equiv 1 \pmod{23}$?

What is the interpretation of $a \equiv b$ mod $H$ in group theory?

Solving congruences

$A^7 \not\equiv A \pmod{13}$ implies $A^{78} + 1 \equiv 0 \pmod{169}$

Finding the smallest $x$ given a set of congruence conditions.

Modular Arithmatic - Solving congruences

Chinese remainder problem

Having trouble with Chinese Remainder Theorem

Suppose that $m \ge 0$ show that $49 \mid 5\cdot3^{4m + 2} + 53\cdot2^{5m}$

factoring polynomials in $\Bbb Z/11\Bbb Z$

How to solve system of congruence?

Prove that if $n$ is not divisible by $5$, then $n^4 \equiv 1 \pmod{5}$

Prove that $l = k/\gcd(m,k)$.

Can we say If q is incongruent to p modulo n then $q\equiv -p$ (mod n)

Trending Questions

Popular # Hahtags

Popular Questions