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:
“If any proof were needed of the progress of the cause for which I have worked, it is here tonight. The presence on the stage of these college women, and in the audience of all those college girls who will some day be the nation’s greatest strength, will tell their own story to the world.”
—Susan B. Anthony (1820–1906)
“We often overestimate the influence of a peer group on our teenager. While the peer group is most influential in matters of taste and preference, we parents are most influential in more abiding matters of standards, beliefs, and values.”
—David Elkind (20th century)
“The weakness of the man who, when his theory works out into a flagrant contradiction of the facts, concludes “So much the worse for the facts: let them be altered,” instead of “So much the worse for my theory.””
—George Bernard Shaw (1856–1950)