Question

Showing $x^2 \equiv 1 \pmod p$ implies $x \equiv \pm 1 \pmod p$

score 107 · Answer 1 · 2018-10-07 02:08:39

107

Views

Showing $x^2 \equiv 1 \pmod p$ implies $x \equiv \pm 1 \pmod p$

Published on 07 Oct 2018 - 2:08

score 331 · Answer 2 · 2018-10-07 07:00:55

331

Views

What is the last digit of $7^{3553}$?

Published on 07 Oct 2018 - 7:00

score 40 · Answer 3 · 2018-10-07 14:56:39

40

Views

Mod of a Mod, solving $x\equiv 2 \pmod{3\pmod{4}}$

Published on 07 Oct 2018 - 14:56

score 164 · Answer 4 · 2018-10-07 18:38:48

164

Views

Prove $((u \mod N) \cdot (v \mod N) ) \mod N=(u \cdot v) \mod N?$

Published on 07 Oct 2018 - 18:38

score 151 · Answer 5 · 2026-03-25 12:35:05

151

Views

How to tell if system of congruences where each base is a power of prime $p$ has a solution

Published on 25 Mar 2026 - 12:35

score 1.1k · Answer 6 · 2018-10-07 19:59:43

1.1k

Views

There are three lights which can be in one of three states. Can we get the system of lights into a specific state?

Published on 07 Oct 2018 - 19:59

score 26 · Answer 7 · 2018-10-07 22:11:16

26

Views

$\int_0^k \sin(tx-mod(\frac{\pi}{2}(t-1),2\pi))dt$

Published on 07 Oct 2018 - 22:11

score 109 · Answer 8 · 2026-03-26 12:38:27

109

Views

Sum of elements of order dividing a divisor of $p-1$ in the group of units of $\mathbb{Z}/p\mathbb{Z}$

Published on 26 Mar 2026 - 12:38

score 2.3k · Answer 9 · 2018-10-08 20:15:45

2.3k

Views

Show $a^k ≡ b^k\pmod m$

Published on 08 Oct 2018 - 20:15

score 75 · Answer 10 · 2018-10-10 06:20:01

75

Views

Primes congruent to $k \pmod p$ between $p$ and $p^2$?

Published on 10 Oct 2018 - 6:20

score 61 · Answer 11 · 2026-03-25 20:57:57

61

Views

Can we deduce the (a^b)^c mod from the partial information a^b mod d and a^c mod d in Diffie-Hellman Key Exchange?

Published on 25 Mar 2026 - 20:57

score 52 · Answer 12 · 2026-03-25 06:10:29

52

Views

How to find $n$ in this equation? (involving modulus)

Published on 25 Mar 2026 - 6:10

score 65 · Answer 13 · 2026-03-26 16:09:48

65

Views

Dividing $n^k+1$ by $n+1$ if and only if $k$ is odd

Published on 26 Mar 2026 - 16:09

score 179 · Answer 14 · 2018-10-11 15:18:09

179

Views

Finding X for Mod?

Published on 11 Oct 2018 - 15:18

score 1k · Answer 15 · 2018-10-11 16:36:11

1k

Views

11x - 7 = 0 (mod 13), What is this?

Published on 11 Oct 2018 - 16:36

List Question

Showing $x^2 \equiv 1 \pmod p$ implies $x \equiv \pm 1 \pmod p$

What is the last digit of $7^{3553}$?

Mod of a Mod, solving $x\equiv 2 \pmod{3\pmod{4}}$

Prove $((u \mod N) \cdot (v \mod N) ) \mod N=(u \cdot v) \mod N?$

How to tell if system of congruences where each base is a power of prime $p$ has a solution

There are three lights which can be in one of three states. Can we get the system of lights into a specific state?

$\int_0^k \sin(tx-mod(\frac{\pi}{2}(t-1),2\pi))dt$

Sum of elements of order dividing a divisor of $p-1$ in the group of units of $\mathbb{Z}/p\mathbb{Z}$

Show $a^k ≡ b^k\pmod m$

Primes congruent to $k \pmod p$ between $p$ and $p^2$?

Can we deduce the (a^b)^c mod from the partial information a^b mod d and a^c mod d in Diffie-Hellman Key Exchange?

How to find $n$ in this equation? (involving modulus)

Dividing $n^k+1$ by $n+1$ if and only if $k$ is odd

Finding X for Mod?

11x - 7 = 0 (mod 13), What is this?

Trending Questions

Popular # Hahtags

Popular Questions