Abstract
These three theorems, especially the one by Euler,play a central role in many modern applications, such as digital encryption. They are deeply related to the theory of groups, and indeed, their most elegant proofs are group theoretic. Here, however, we shall stress the purely arithmetic viewpoint. We also introduce the important Euler φ function (or totient function) which reaches into every corner of number theory and which, by way of illustration, tells us how many ways an n-pointed star can be drawn by n straight lines without lifting the pen.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Halberstam, C. Hooley (eds.): Progress in Analytic Number Theory, Vol. I ( Academic, London 1981 )
R. H. Hudson: A common combinatorial principle underlies Riemann’s formula,the Chebyshev phenomenon, and other subtle effects in comparative prime number theory. J. reine angew. Math. 313, 133–150 (1980)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schroeder, M.R. (1984). The Theorems of Fermat, Wilson and Euler. In: Number Theory in Science and Communication. Springer Series in Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02395-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-02395-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-02397-6
Online ISBN: 978-3-662-02395-2
eBook Packages: Springer Book Archive