
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
December 18th, 2016, 09:37 AM  #1 
Newbie Joined: Dec 2016 From: Saudi Arabia Posts: 4 Thanks: 0  New proof for Fermat's little theorem
Again, I don't really know whether this proof is known or not but I'm trying the chance again hhh. Ok so Fermat's little theorem says: a^p = a [p], for p prime and a any integer. We will use the following property: if p is prime, p is a divisor of the C(p,j) for j>0 and j<p. with this identity for every k and i integers: (ki)^p = (ki1+1)^p=(k(i+1))^p +1 +sum_of_binomial coefficients (that have p as divisor as stated above) we'll have then (ki)^p  (k(i+1))^p = 1 [p] by summing up this formula from i=0 to i =k1, we will have: k^p = k [p] I hope it's not rubbish writing. Last edited by skipjack; December 18th, 2016 at 10:28 PM. 
December 18th, 2016, 10:02 PM  #2 
Member Joined: Dec 2016 From: USA Posts: 43 Thanks: 9 
Nice proof.


Tags 
fermat, proof, theorem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Proof of Fermat's Last Theorem  mathsman1  Math  14  July 9th, 2016 05:45 PM 
Simpler proof of fermat's last theorem  MrAwojobi  Number Theory  46  August 12th, 2015 06:04 AM 
Fermat's last theorem proof  MrAwojobi  Number Theory  20  June 16th, 2014 08:32 PM 
SIMPLEST PROOF OF FERMAT'S LAST THEOREM  MrAwojobi  Number Theory  43  July 15th, 2013 06:27 AM 
6 Step Fermat's Last Theorem Proof  gyro  Number Theory  7  May 9th, 2012 07:05 AM 