Let p be a prime number, not 2 or 5.

Show that $\displaystyle 10^{p-1} \equiv 1 \pmod p \quad \quad$

I can show the workings for some primes i.e 3,7 but how do i show for all primes except 2 and 5?

thanks

Printable View

- Jan 11th 2010, 08:12 AMcharikaarFermat's Little Theorem
Let p be a prime number, not 2 or 5.

Show that $\displaystyle 10^{p-1} \equiv 1 \pmod p \quad \quad$

I can show the workings for some primes i.e 3,7 but how do i show for all primes except 2 and 5?

thanks - Jan 11th 2010, 08:43 AMDrexel28