Fermat's little theorem

1. Mar 18, 2009

1. The problem statement, all variables and given/known data

From fermat's little theorem deduce that when p is prime,

n^p is equivalent to n (mod p)

for all integers n.

2. Relevant equations

3. The attempt at a solution

I know from Fermat's Little Theorem that ,

n^(p-1) is equivalent to 1 (mod p),

but i don't know how to use it for this particular question.

2. Mar 18, 2009

Dick

If a is equivalent to b mod(p) then c*a is equivalent to c*b mod(p). What might be a good choice for c in your problem?

3. Mar 18, 2009

ok, so in my question, c=n ?
So by dividing by n i would get,

1^p is equiavlent to 1 (mod p)

How do i reach n^(p-1) on the left hand side?

4. Mar 18, 2009

Dick

n^p divided by n IS NOT 1^p. PLEASE stop and review algebra with exponents before you try to continue.

5. Mar 18, 2009

sorry, silly mistake.
dividing by n would give me,

n^(p-1) equivalent to 1 (mod p)

which is fermat's little theorem. so is this all i need to do?

6. Mar 18, 2009