Proof Using Group Theory
This proof requires the most basic elements of group theory.
The idea is to recognise that the set G = {1, 2, …, p − 1}, with the operation of multiplication (taken modulo p), forms a group. The only group axiom that requires some effort to verify is that each element of G is invertible. Taking this on faith for the moment, let us assume that a is in the range 1 ≤ a ≤ p − 1, that is, a is an element of G. Let k be the order of a, so that k is the smallest positive integer such that
By Lagrange's theorem, k divides the order of G, which is p − 1, so p − 1 = km for some positive integer m. Then
Read more about this topic: Proofs Of Fermat's Little Theorem
Famous quotes containing the words proof, group and/or theory:
“The moment a man begins to talk about technique that’s proof that he is fresh out of ideas.”
—Raymond Chandler (1888–1959)
“There is nothing in the world that I loathe more than group activity, that communal bath where the hairy and slippery mix in a multiplication of mediocrity.”
—Vladimir Nabokov (1899–1977)
“No theory is good unless it permits, not rest, but the greatest work. No theory is good except on condition that one use it to go on beyond.”
—André Gide (1869–1951)