induction

for those who have`nt followed, the question is this:

n^{p-n} is divisible by p. then prove that p is a prime number...

now try it.

Here `n` must be a integer as far as my solution is concerned..

let's take an ex:- 3^5-3 is not divisible by 5.but that doesen't mean 5 is not a prime no.

He's asking for Fermat's theorem, proof by Induction