List questions from modular-arithmetic

Published on 01 Oct 2019 - 0:07

48

Views

about a fundamental domain and its volume

Published on 27 Mar 2026 - 18:34

136

Views

Use Wilson's Theorem to show $(q!)^2+(-1)^q \equiv 0$ mod p

Published on 01 Oct 2019 - 8:36

66

Views

Checking a result obtained by Chinese Remainder Theorem

Published on 01 Oct 2019 - 17:27

643

Views

Clarify a problem with prime and composite numbers

Published on 12 Mar 2014 - 4:20

3.5k

Views

Modular exponentiation with Chinese Remainder Theorem

Published on 12 Mar 2014 - 5:07

98

Views

A question on GCD

Published on 12 Mar 2014 - 15:51

69

Views

Modular Arithmetic - Finding the smallest possible length of the room in inches

Published on 13 Mar 2014 - 4:34

2.3k

Views

Finding remainder when $32^{32^{32}}$ is divided by $7$

Published on 14 Mar 2014 - 13:36

355

Views

Modular Arithmetic - Quadratic Solutions Problem

Published on 15 Mar 2014 - 10:49

37

Views

How do I calculate the number of times angle X should be added to obtain angle Y?

Published on 15 Mar 2014 - 17:47

2.2k

Views

Prove that $2^x \cdot 3^y - 5^z \cdot 7^w = 1$ has no solutions

Published on 29 Mar 2026 - 12:52

264

Views

Proving that $mx \equiv 0 \pmod n$ has $\gcd(m, n)$ solutions in the interval $[0, n-1]$

Published on 25 Mar 2026 - 13:55

1.9k

Views

Convert modulo 65 into modulo 26.

Published on 16 Mar 2014 - 19:06

73

Views

Do we not have to follow Euclidean division strictly when doing modulo operations?

Published on 25 Mar 2026 - 15:46

List Question

Help with finding solutions to $x^3\equiv 1 \pmod{61}$ etc.

about a fundamental domain and its volume

Use Wilson's Theorem to show $(q!)^2+(-1)^q \equiv 0$ mod p

Checking a result obtained by Chinese Remainder Theorem

Clarify a problem with prime and composite numbers

Modular exponentiation with Chinese Remainder Theorem

A question on GCD

Modular Arithmetic - Finding the smallest possible length of the room in inches

Finding remainder when $32^{32^{32}}$ is divided by $7$

Modular Arithmetic - Quadratic Solutions Problem

How do I calculate the number of times angle X should be added to obtain angle Y?

Prove that $2^x \cdot 3^y - 5^z \cdot 7^w = 1$ has no solutions

Proving that $mx \equiv 0 \pmod n$ has $\gcd(m, n)$ solutions in the interval $[0, n-1]$

Convert modulo 65 into modulo 26.

Do we not have to follow Euclidean division strictly when doing modulo operations?

Trending Questions

Popular # Hahtags

Popular Questions