Applications of Fermat’s and Euler’s Theorems

  • Lindsay N. Childs
Part of the Undergraduate Texts in Mathematics book series (UTM)


This chapter is devoted to some applications of Fermat’s and Euler’s theorems, mostly to numbers: decimal expansions, testing numbers for primeness, factoring numbers. Perhaps the most striking application, in Section B, is to the design of a cryptographic system, the RSA cryptosystem, which has spawned an enormous amount of research on factoring large numbers since the system was discovered in the late 1970s.


Prime Divisor Fermat Number Decimal Expansion Perfect Number Plaintext Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Lindsay N. Childs
    • 1
  1. 1.Department of MathematicsSUNY at AlbanyAlbanyUSA

Personalised recommendations