Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
Post a reply
Topic review (newest first)
- kylekatarn
- 2005-11-07 04:19:25
glad to be of help 
- iman
- 2005-11-07 02:50:08
hi kylekatarn
it was the same proof i wanted!
thank you very much
- kylekatarn
- 2005-11-06 23:38:00
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
- iman
- 2005-11-06 18:29:11
yes
please give me it's proof!
i'm waiting
- kylekatarn
- 2005-11-06 06:46:27
so you want a proof that:
∀p∈ℙ, ∃k∈ℕ : p=k[a^(p-1) -1]
- iman
- 2005-11-06 06:12:01
(p,a)=1
a is prime rather than p
- kylekatarn
- 2005-11-06 05:59:36
a∈R?
a∈N?
- iman
- 2005-11-06 03:48:56
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