# Tag Archives: Prime Number

## Euler’s Generalization of Fermat’s Little Theorem

Fermat's Little Theorem says: Theorem 1. (Fermat) If $$p$$ is a prime number and $$(a,~p)=1,$$ that is, if $$a$$ and $$p$$ are relatively primes, then $$a^{p-1}\equiv 1$$ $$({\rm mod}~ p).$$ Euler gave a generalization of Fermat's theorem. His generalization will follow at once from next theorem, which is proceed by counting, using essentially the same argument as in… Read More »