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:
“It comes to pass oft that a terrible oath, with a swaggering accent sharply twanged off, gives manhood more approbation than ever proof itself would have earned him.”
—William Shakespeare (1564–1616)
“Now, honestly: if a large group of ... demonstrators blocked the entrances to St. Patrick’s Cathedral every Sunday for years, making it impossible for worshipers to get inside the church without someone escorting them through screaming crowds, wouldn’t some judge rule that those protesters could keep protesting, but behind police lines and out of the doorways?”
—Anna Quindlen (b. 1953)
“Don’t confuse hypothesis and theory. The former is a possible explanation; the latter, the correct one. The establishment of theory is the very purpose of science.”
—Martin H. Fischer (1879–1962)