what is euler's proof for fermat's theorem? whose is said:if p a prime number then p divide a^p-1 -1
a is prime rather than p
so you want a proof that:
∀p∈ℙ, ∃k∈ℕ : p=k[a^(p-1) -1]
please give me it's proof!
You can check the following sites. I think they have the proof you want:
http://planetmath.org/encyclopedia/Proo … eorem.html
it was the same proof i wanted!
thank you very much