List questions from modular-arithmetic

Published on 11 Apr 2026 - 14:23

146

Views

Consistent hashing using modulo

Published on 11 Apr 2026 - 2:14

1.6k

Views

Proving $(a+b)^{p} \equiv a^{p} + b^{p} \pmod{p}$ for prime $p$

Published on 01 Dec 2014 - 9:41

1.5k

Views

Prove the existence of non trivial solution

Published on 01 Dec 2014 - 12:04

1.9k

Views

Does the congruence $x^2 - 3x - 1 \equiv 0$ (mod 31957) have any solutions?

Published on 26 Mar 2026 - 23:11

1k

Views

Show that $p$ must be congruent to either 1 or 4 modulo 5

Published on 02 Dec 2014 - 2:49

93

Views

Proof that $(k+m)^2 \mod{n}$ is not injective

Published on 02 Dec 2014 - 15:36

45

Views

Size of increments in commutative ring to reach given number

Published on 01 Apr 2026 - 14:26

241

Views

Principal Square Roots Mod

Published on 02 Dec 2014 - 18:35

45

Views

Elliptic curves: Can I replace a coordinate with any modularly equivalent number?

Published on 27 Mar 2026 - 13:39

9.4k

Views

The inverse of $4$ modulo $9$

Published on 26 Mar 2026 - 16:05

2k

Views

Inverses modulo a prime power

Published on 04 Dec 2014 - 16:25

124

Views

How to solve $x^2 \equiv [1]$ in $\Bbb Z_5$

Published on 26 Mar 2026 - 16:05

1.5k

Views

In Zagier's one-sentence proof, why is S defined to be {(x,y,z)∈ℕ^3:x^2+4yz=p,p prime}?

Published on 04 Dec 2014 - 19:58

43

Views

Given some large integer, is there way to construct a modulus such that the remainder that is below some threshold?

Published on 04 Dec 2014 - 21:47

List Question

How to prove integers has a cubic root mod p?

Consistent hashing using modulo

Proving $(a+b)^{p} \equiv a^{p} + b^{p} \pmod{p}$ for prime $p$

Prove the existence of non trivial solution

Does the congruence $x^2 - 3x - 1 \equiv 0$ (mod 31957) have any solutions?

Show that $p$ must be congruent to either 1 or 4 modulo 5

Proof that $(k+m)^2 \mod{n}$ is not injective

Size of increments in commutative ring to reach given number

Principal Square Roots Mod

Elliptic curves: Can I replace a coordinate with any modularly equivalent number?

The inverse of $4$ modulo $9$

Inverses modulo a prime power

How to solve $x^2 \equiv [1]$ in $\Bbb Z_5$

In Zagier's one-sentence proof, why is S defined to be {(x,y,z)∈ℕ^3:x^2+4yz=p,p prime}?

Given some large integer, is there way to construct a modulus such that the remainder that is below some threshold?

Trending Questions

Popular # Hahtags

Popular Questions