New posts in Congruences

Prove that $7^{100} - 3^{100}$ is divisible by $1000$

Induction proof: $2^n + 3^n ≡ 5^n (mod 6)$

Uniqueness of $k$th root mod $m$ if $(k, \phi(m)) = 1$.

Find the last three digits of $383^{101}$

A power even smaller than Fermat's Little Theorem suggests?

Why is modular arithmetic defined as a "similarity" and not an operation?

Is the finite sum of factorials constant modulo the summation limit?

Prove that $\sum^{n-1}_{i=1}i^{(n-1)} \equiv -1$ (mod $n$) for all prime $n\in\mathbb{N}$.

Can I apply Chinese remainder theorem here?

Find out all solutions of the congruence $x^2 \equiv 9 \mod 256$.