List questions from modular-arithmetic

Published on 05 Sep 2019 - 17:09

72

Views

Batching items using Chinese Remainder Theorem

Published on 25 Mar 2026 - 21:44

151

Views

Prove that $\pm 5, \pm 5^2 ,...,\pm5^{2^{a-2}}$ forms a reduced residue system mod $2^a$

Published on 05 Sep 2019 - 19:16

27.8k

Views

Prove that if a ≡ b mod m and c ≡ d mod m, then ac ≡ bd mod m.

Published on 06 Sep 2019 - 6:15

157

Views

square ($a \bmod b$)

Published on 06 Sep 2019 - 16:06

58

Views

Find the solutions of an equation in mod 8

Published on 06 Sep 2019 - 17:57

153

Views

Linear congruence $8x\equiv 21\pmod{24}$

Published on 07 Sep 2019 - 3:43

192

Views

Find a solution for $x^2\equiv -2 \pmod{p}$, when $p$ is an odd prime factor of $a^2+2b^2$ but not a factor for $a$ or $b$.

Published on 08 Sep 2019 - 5:47

90

Views

Proof that with $b < 0$, $a$ mod $b \in (b,0]$

Published on 26 Mar 2026 - 22:58

300

Views

Prove that $\gcd(a,b) = \gcd(b, r) \neq \gcd(a, r)$ where $r$ is the remainder of dividing $a$ by $b$

Published on 27 Mar 2026 - 16:17

259

Views

Prove that J is a subgroup of G

Published on 03 Apr 2026 - 12:41

28

Views

Help with a proof in modular arithmetic

Published on 09 Sep 2019 - 17:08

97

Views

Help with proof gcd and modular arithmetic

Published on 27 Mar 2026 - 16:12

366

Views

Prove commutative subgroup

Published on 27 Mar 2026 - 14:55

49

Views

Greatest common divisor / euclidean algorithm

Published on 09 Sep 2019 - 23:17

List Question

Why does $x^7 = 5$ (mod 11) simplify into $5x^3 = 1$ (mod 11)?

Batching items using Chinese Remainder Theorem

Prove that $\pm 5, \pm 5^2 ,...,\pm5^{2^{a-2}}$ forms a reduced residue system mod $2^a$

Prove that if a ≡ b mod m and c ≡ d mod m, then ac ≡ bd mod m.

square ($a \bmod b$)

Find the solutions of an equation in mod 8

Linear congruence $8x\equiv 21\pmod{24}$

Find a solution for $x^2\equiv -2 \pmod{p}$, when $p$ is an odd prime factor of $a^2+2b^2$ but not a factor for $a$ or $b$.

Proof that with $b < 0$, $a$ mod $b \in (b,0]$

Prove that $\gcd(a,b) = \gcd(b, r) \neq \gcd(a, r)$ where $r$ is the remainder of dividing $a$ by $b$

Prove that J is a subgroup of G

Help with a proof in modular arithmetic

Help with proof gcd and modular arithmetic

Prove commutative subgroup

Greatest common divisor / euclidean algorithm

Trending Questions

Popular # Hahtags

Popular Questions