# Difference between revisions of "Fermat's Little Theorem"

(→Proof 3 (Combinatorics)) |
(Added a group theoretic proof to prove Fermat's Little Theorem.) |
||

Line 98: | Line 98: | ||

maps one unit hypercube to a distinct hypercube. Much like the combinatorial proof, this splits the non-main diagonal unit hypercubes into groups of size <math>p</math>, from which it follows that <math>a^p \equiv a \pmod{p}</math>. Thus, we have another way to visualize the above combinatorial proof, by imagining the described transformation to be, in a sense, a rotation about the main diagonal of the hypercube. | maps one unit hypercube to a distinct hypercube. Much like the combinatorial proof, this splits the non-main diagonal unit hypercubes into groups of size <math>p</math>, from which it follows that <math>a^p \equiv a \pmod{p}</math>. Thus, we have another way to visualize the above combinatorial proof, by imagining the described transformation to be, in a sense, a rotation about the main diagonal of the hypercube. | ||

+ | |||

+ | === Proof 5 (Abstract Algebra) === | ||

+ | Consider the number of ways to color a <math>p</math>-beaded oriented necklace in <math>a</math> colors up to symmetry where <math>p</math> is prime. The group <math>C_p</math>, or the cyclic group of order <math>p</math>, acts on the <math>a</math> colorings of an oriented necklace by rotation. The identity fixes all <math>a^p</math> of the colorings by definition. If <math>g\in C_p</math> where <math>g\ne e</math> then <math>g</math> permutes the necklace in a single orbit which we can denote as <math>\mathcal{O}</math> (since the size of the orbit is a factor of <math>p</math>). Hence, if <math>g\ne e</math> then <math>g</math> fixes only the <math>a</math> monochromatic paintings. By [https://artofproblemsolving.com/wiki/index.php/Burnside%27s_Lemma Burnside's Lemma] the number of ways to paint the necklace (up to symmetry) is | ||

+ | <center><cmath>|\mathcal{O}|=\frac{1}{|G|}\sum_{g\in G}|\text{Fix}(g)|=\frac{1}{p}\sum_{g\in C_p}|\text{Fix}(g)|=\frac{1}{p}|\text{Fix}(e)|+\frac{1}{p}\sum_{g\in C_p}|\text{Fix}(g)|.</cmath></center><br> | ||

+ | This simplifies to | ||

+ | <center><cmath>\frac{a^p}{p}+\frac{a(p-1)}{p}=a+\frac{a^p-a}{p}</cmath></center><br> | ||

+ | and since <math>|\mathcal{O}|</math> must be an integer we must have that <math>a^p-a\mid p</math> or that <math>a^p-a\equiv\pmod{p}\implies a^{p}\equiv a\pmod{p}</math> which finishes <math>\square</math> | ||

== Problems == | == Problems == |

## Revision as of 19:10, 24 November 2021

**Fermat's Little Theorem** is highly useful in number theory for simplifying the computation of exponents in modular arithmetic (which students should study more at the introductory level if they have a hard time following the rest of this article). This theorem is credited to Pierre de Fermat.

## Contents

## Statement

If is an integer, is a prime number and is not divisible by , then .

A frequently used corollary of Fermat's Little Theorem is . As you can see, it is derived by multipling both sides of the theorem by . The restated form is nice because we no longer need to restrict ourselves to integers not divisible by .

This theorem is a special case of Euler's Totient Theorem, which states that if and are integers, then , where denotes Euler's totient function. In particular, for prime numbers . In turn, this is a special case of Lagrange's Theorem.

In contest problems, Fermat's Little Theorem is often used in conjunction with the Chinese Remainder Theorem to simplify tedious calculations.

## Proof

We offer several proofs using different techniques to prove the statement . If , then we can cancel a factor of from both sides and retrieve the first version of the theorem.

### Proof 1 (Induction)

The most straightforward way to prove this theorem is by by applying the induction principle. We fix as a prime number. The base case, , is obviously true. Suppose the statement is true. Then, by the binomial theorem,

Note that divides into any binomial coefficient of the form for . This follows by the definition of the binomial coefficient as ; since is prime, then divides the numerator, but not the denominator.

Taken , all of the middle terms disappear, and we end up with . Since we also know that , then , as desired.

### Proof 2 (Inverses)

Let . Then, we claim that the set , consisting of the product of the elements of with , taken modulo , is simply a permutation of . In other words,

Clearly none of the for are divisible by , so it suffices to show that all of the elements in are distinct. Suppose that . Since , by the cancellation rule, that reduces to which means as

Thus, , we have that the product of the elements of is

Cancelling the factors from both sides, we are left with the statement .

A similar version can be used to prove Euler's Totient Theorem, if we let .

### Proof 3 (Combinatorics)

An illustration of the case .

Consider a necklace with beads, each bead of which can be colored in different ways. There are ways to pick the colors of the beads. of these are necklaces that consists of beads of the same color. Of the remaining necklaces, for each necklace, there are exactly more necklaces that are rotationally equivalent to this necklace. It follows that must be divisible by . Written in another way, .

### Proof 4 (Geometry)

We imbed a hypercube of side length in (the -th dimensional Euclidean space), such that the vertices of the hypercube are at . A hypercube is essentially a cube, generalized to higher dimensions. This hypercube consists of separate unit hypercubes, with centers consisting of the points

where each is an integer from to . Besides the centers of the unit hypercubes in the main diagonal (from to ), the transformation carrying

maps one unit hypercube to a distinct hypercube. Much like the combinatorial proof, this splits the non-main diagonal unit hypercubes into groups of size , from which it follows that . Thus, we have another way to visualize the above combinatorial proof, by imagining the described transformation to be, in a sense, a rotation about the main diagonal of the hypercube.

### Proof 5 (Abstract Algebra)

Consider the number of ways to color a -beaded oriented necklace in colors up to symmetry where is prime. The group , or the cyclic group of order , acts on the colorings of an oriented necklace by rotation. The identity fixes all of the colorings by definition. If where then permutes the necklace in a single orbit which we can denote as (since the size of the orbit is a factor of ). Hence, if then fixes only the monochromatic paintings. By Burnside's Lemma the number of ways to paint the necklace (up to symmetry) is

This simplifies to

and since must be an integer we must have that or that which finishes

## Problems

### Introductory

- Compute some examples, for example find , and , and check your answers by calculator where possible.

- Let . What is the units digit of ? (2008 AMC 12A Problems/Problem 15)

- Find mod . (Discussion).

### Intermediate

- One of Euler's conjectures was disproved in the 1960s by three American mathematicians when they showed there was a positive integer such that . Find the value of . (1989 AIME, #9)

- If , find the last two digits of . (2008 PUMaC, NT A#5)

### Advanced

- Is it true that if is a prime number, and is an integer , then the sum of the products of each -element subset of will be divisible by ?

## Hints/Solutions

Introductory:

- Hint: For the first example, we have by FLT (Fermat's Little Theorem). It follows that .

Intermediate:

- Solution (1989 AIME, 9) To solve this problem, it would be nice to know some information about the remainders can have after division by certain numbers. By Fermat's Little Theorem, we know is congruent to modulo 5. Hence,

- Continuing, we examine the equation modulo 3,

- Thus, is divisible by three and leaves a remainder of four when divided by 5. It's obvious that , so the only possibilities are or . It quickly becomes apparent that 174 is much too large, so must be 144.

Advanced:

- Hint: try to establish the identity , and then apply Vieta's formulas.

## Extensions

If is an integer, is a prime number and is not divisible by , then .

The above follows from the exponent rule

An extension of the Collary given above is that :

Immediately by normal exponent rules, it follows that if: Then, Which means, by repeating the process, we have that we can reduce the exponent to its digital root base .