- #1

- 40

- 0

## Homework Statement

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

n^p is equivalent to n (mod p)

for all integers n.

## Homework Equations

## 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.