Proofs of Fermat's Little Theorem - Proof Using The Multinomial Expansion

Proof Using The Multinomial Expansion

The proof is a very simple application of the Multinomial formula which is brought here for the sake of simplicity.

(x_1 + x_2 + \cdots + x_m)^n = \sum_{k_1,k_2,\ldots,k_m} {n \choose k_1, k_2, \ldots, k_m} x_1^{k_1} x_2^{k_2} \cdots x_m^{k_m}.

The summation is taken over all sequences of nonnegative integer indices k1 through km such the sum of all ki is n.

Thus if we express a as a sum of 1s (ones), we obtain

a^p = \sum_{k_1,k_2,\ldots,k_a} {p \choose k_1, k_2, \ldots, k_a}

Clearly, if p is prime, and if kj not equal to p for any j, we have

and

if kj equal to p for some j

Since there are exactly a elements such that the theorem follows.

Read more about this topic:  Proofs Of Fermat's Little Theorem

Famous quotes containing the words proof and/or expansion:

    “The thing with Catholicism, the same as all religions, is that it teaches what should be, which seems rather incorrect. This is “what should be.” Now, if you’re taught to live up to a “what should be” that never existed—only an occult superstition, no proof of this “should be”Mthen you can sit on a jury and indict easily, you can cast the first stone, you can burn Adolf Eichmann, like that!”
    —Lenny Bruce (1925–1966)

    “The fundamental steps of expansion that will open a person, over time, to the full flowering of his or her individuality are the same for both genders. But men and women are rarely in the same place struggling with the same questions at the same age.”
    —Gail Sheehy (20th century)