Question

Prove $gcd(m,n)=p\implies Φ(mn)=(p/p-1)Φ(m)Φ(n)$

score 425 · Answer 1 · 2019-12-12 18:07:28

425

Views

Prove $gcd(m,n)=p\implies Φ(mn)=(p/p-1)Φ(m)Φ(n)$

Published on 12 Dec 2019 - 18:07

score 964 · Answer 2 · 2019-12-12 18:15:28

964

Views

Prove that $(p-2)! \equiv 1\mod p$ without using Wilson's Theorem.

Published on 12 Dec 2019 - 18:15

score 99 · Answer 3 · 2019-12-13 06:46:21

99

Views

Computing $\gcd\{n^k - n^\ell : n \in \mathbb Z\}$

Published on 13 Dec 2019 - 6:46

score 1k · Answer 4 · 2019-12-13 11:39:46

1k

Views

Suppose that $a \equiv b\mod m$ and that $a \equiv b\mod n $ .Assuming gcd$(m;n) = 1 $ ,prove that $a \equiv b\mod mn$

Published on 13 Dec 2019 - 11:39

score 779 · Answer 5 · 2026-04-12 02:05:28

779

Views

Isn't 1 congruent to -1?

Published on 12 Apr 2026 - 2:05

score 44 · Answer 6 · 2026-04-13 00:21:19

44

Views

The quotient remainder theorem

Published on 13 Apr 2026 - 0:21

score 52 · Answer 7 · 2026-04-11 18:53:48

52

Views

Equality in Modular Congruence: $a\equiv b\pmod p$ implies $a=b$

Published on 11 Apr 2026 - 18:53

score 232 · Answer 8 · 2026-04-13 10:05:12

232

Views

Modulus system of equations and modular arithmetic.

Published on 13 Apr 2026 - 10:05

score 32 · Answer 9 · 2026-04-12 18:49:43

32

Views

Understanding the proof of $a\equiv b\pmod{n}\implies r_n(a)=r_n(b)$

Published on 12 Apr 2026 - 18:49

score 255 · Answer 10 · 2026-03-25 16:01:59

255

Views

Rightmost decimal digits of Graham's number

Published on 25 Mar 2026 - 16:01

score 128 · Answer 11 · 2026-04-09 19:12:43

128

Views

Finding all solutions to a system of congruence equations

Published on 09 Apr 2026 - 19:12

score 184 · Answer 12 · 2019-12-16 16:24:27

184

Views

Computing $a^b$ (mod c) where b is a very large number

Published on 16 Dec 2019 - 16:24

score 176 · Answer 13 · 2026-04-09 06:54:31

176

Views

solutions for modular arithmetic equation

Published on 09 Apr 2026 - 6:54

score 151 · Answer 14 · 2026-04-13 00:52:42

151

Views

Why can't I use Fermat's Small Theorem to calculate $12^{12^{12}} \pmod{13}$?

Published on 13 Apr 2026 - 0:52

score 36 · Answer 15 · 2026-03-28 09:53:28

36

Views

Determine if $f: \Bbb Z_{4711} \rightarrow \Bbb Z_{4711}, f(x) = 1632x+1792$ is injective, surjective, bijective and/or invertible

Published on 28 Mar 2026 - 9:53

List Question

Prove $gcd(m,n)=p\implies Φ(mn)=(p/p-1)Φ(m)Φ(n)$

Prove that $(p-2)! \equiv 1\mod p$ without using Wilson's Theorem.

Computing $\gcd\{n^k - n^\ell : n \in \mathbb Z\}$

Suppose that $a \equiv b\mod m$ and that $a \equiv b\mod n $ .Assuming gcd$(m;n) = 1 $ ,prove that $a \equiv b\mod mn$

Isn't 1 congruent to -1?

The quotient remainder theorem

Equality in Modular Congruence: $a\equiv b\pmod p$ implies $a=b$

Modulus system of equations and modular arithmetic.

Understanding the proof of $a\equiv b\pmod{n}\implies r_n(a)=r_n(b)$

Rightmost decimal digits of Graham's number

Finding all solutions to a system of congruence equations

Computing $a^b$ (mod c) where b is a very large number

solutions for modular arithmetic equation

Why can't I use Fermat's Small Theorem to calculate $12^{12^{12}} \pmod{13}$?

Determine if $f: \Bbb Z_{4711} \rightarrow \Bbb Z_{4711}, f(x) = 1632x+1792$ is injective, surjective, bijective and/or invertible

Trending Questions

Popular # Hahtags

Popular Questions