induction

n to the power p -n;divisible by p. p is a prime number. prove it

3 Answers

39
Dr.House ·

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

11
Tarun Kumar Yadav ·

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

341
Hari Shankar ·

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

Your Answer

Close [X]