Help with a proof in modular arithmetic
11500
Divisibility by 7 rule, and Congruence Arithmetic Laws
3632
Basic number theory proofs
5708
Prove that if $k\ge 1\,$ and $\,a^k\equiv 1\pmod{\! n}$ then $\gcd(a,n)=1$
44033
Number theory lemma - $x^2 \equiv 1 \pmod p$ implies $x\equiv\pm 1\pmod p$
22029
Solving modular arithmetic questions
141704
Fractional exponentiation in modular arithmetic
137175
Fermat's little theorem proof by Euler
46147
Proving $(\forall a\in\mathbb{Z^+})(m\in\mathbb{Z^+}\to a^m\equiv a^{m-\phi(m)}\pmod{m})$
45171
How prove this $(p-1)!\left(1+\frac{1}{2}+\frac{1}{3}+\cdots+\frac{1}{p-1}\right)\equiv 0\pmod{p^2}$
33104
Combinatorial Proof with Summation Identity
152299
Proving $a^{n-1} \equiv 1 \mod n $ when n is not prime.
115435
Induction: prove using congruences
52530
There exists a prime congruent to $m$ mod $p$
10966
gcd and lcm from prime factorization proof
46803
Proof that there are infinitely many primes congruent to 3 modulo 4
27063
Prove that if n is an odd positive integer , then $n^2\equiv1\mod8$
63769
Group theory proof of Euler's theorem ($a^{\phi(m)} \equiv 1\mbox{ }(\mbox{mod }m)$ if $\gcd(a,m)=1$)