Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
#1 2005-11-06 03:48:56
- iman
- Guest
euler's proof for fermat's theorem
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
#4 2005-11-06 06:46:27
- kylekatarn
- Power Member
Offline
Re: euler's proof for fermat's theorem
so you want a proof that:
∀p∈ℙ, ∃k∈ℕ : p=k[a^(p-1) -1]
#6 2005-11-06 23:38:00
- kylekatarn
- Power Member
Offline
Re: euler's proof for fermat's theorem
You can check the following sites. I think they have the proof you want:
http://planetmath.org/encyclopedia/Proo … eorem.html
http://www.cut-the-knot.org/blue/Euler.shtml
