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

m |
|||

Line 2: | Line 2: | ||

− | + | == Statement == | |

If <math>{a}</math> is an [[integer]], <math>{p}</math> is a [[prime number]] and <math>{a}</math> is not [[divisibility|divisible]] by <math>{p}</math>, then <math>a^{p-1}\equiv 1 \pmod {p}</math>. | If <math>{a}</math> is an [[integer]], <math>{p}</math> is a [[prime number]] and <math>{a}</math> is not [[divisibility|divisible]] by <math>{p}</math>, then <math>a^{p-1}\equiv 1 \pmod {p}</math>. | ||

Line 8: | Line 8: | ||

Note: This theorem is a special case of [[Euler's Totient Theorem]]. | Note: This theorem is a special case of [[Euler's Totient Theorem]]. | ||

− | + | == Corollary == | |

A frequently used corollary of Fermat's Little Theorem is <math> a^p \equiv a \pmod {p}</math>. | A frequently used corollary of Fermat's Little Theorem is <math> a^p \equiv a \pmod {p}</math>. | ||

As you can see, it is derived by multipling both sides of the theorem by a. The restated form is nice because we no longer need to restrict ourselves to integers <math>{a}</math> not divisible by <math>{p}</math>. | As you can see, it is derived by multipling both sides of the theorem by a. The restated form is nice because we no longer need to restrict ourselves to integers <math>{a}</math> not divisible by <math>{p}</math>. | ||

− | + | == Sample Problem == | |

One of Euler's conjectures was disproved in the 1960s by three American mathematicians when they showed there was a positive integer such that <math>133^5+110^5+84^5+27^5=n^5</math>. Find the value of <math>{n}</math>. ([[AIME]] 1989/9)<br><br> | One of Euler's conjectures was disproved in the 1960s by three American mathematicians when they showed there was a positive integer such that <math>133^5+110^5+84^5+27^5=n^5</math>. Find the value of <math>{n}</math>. ([[AIME]] 1989/9)<br><br> | ||

Line 27: | Line 27: | ||

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

− | + | == Credit == | |

This theorem is credited to [[Pierre de Fermat]]. | This theorem is credited to [[Pierre de Fermat]]. | ||

− | + | == See also == | |

* [[Number theory]] | * [[Number theory]] |

## Revision as of 10:15, 8 November 2007

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

## Statement

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

Note: This theorem is a special case of Euler's Totient Theorem.

## Corollary

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 a. The restated form is nice because we no longer need to restrict ourselves to integers not divisible by .

## Sample Problem

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 . (AIME 1989/9)

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.

## Credit

This theorem is credited to Pierre de Fermat.