Related Concepts
Definition
Fermat’s little theorem states that if p is a prime number and a is any number not divisible by p, then \({a}^{p-1} \equiv 1 \mathbin{\rm mod}\,\,p\).
Background
Pierre de Fermat (1601–1665) was one of the most renowned mathematicians in history. He focused much of his work on Number Theory, though he made great contributions to many other areas of mathematics. Fermat’s famous “last theorem” was a remark Fermat made in a margin of a book, for which he claimed to have a proof but the margin was too small to write it down, and remained an open problem for over three centuries.
Fermat’s little theorem was first stated in a letter to Frénicle de Bessy in 1640, though it was not called “Fermat’s little theorem” until the twentieth century.
Theory
The proof follows easily from the following observations. Consider the product \((a)(2a)(3a)\ldots ((p - 1)a)\), then on...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Conway JH, Guy RK (1996) The book of numbers. Springer, New York
Hardy GH, Wright EM (2008) An introduction to the theory of numbers. Oxford University Press, New York
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Liskov, M. (2011). Fermat’s Little Theorem. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_449
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_449
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering