ON FERMAT’S LITTLE THEOREM
www.math.uchicago.edu › ~may › VIGREto prove Fermat’s Little Theorem well before Euler published his proof in 1736. 2. New Proof of Fermat’s Little Theorem The proof that follows relies on Taylor’s theorem (or the binomial theorem). Theorem 2.1. The expression (2.2) ap 1 1 is divisible by p, where p is a prime and a is an integer, so long as a is not divisible by p. Proof.
Proof of Fermat's Little Theorem - PrimePages
primes.utm.edu › notes › proofsProof of Fermat's Little Theorem. Fermat's "biggest", and also his "last" theorem states that xn + yn = zn has no solutions in positive integers x, y, z with n > 2. This has finally been proven by Wiles in 1995. Here we are concerned with his "little" but perhaps his most used theorem which he stated in a letter to Fre'nicle on 18 October 1640: