You are not logged in.
Pages: 1
hi guys
what is euler's proof for fermat's theorem? whose is said:if p a prime number then p divide a^p-1 -1
(p,a)=1
a is prime rather than p
yes
please give me it's proof!
i'm waiting
Offline
hi kylekatarn
it was the same proof i wanted!
thank you very much
Offline
Pages: 1