Abstract
Already in the Elements, Euclid found the theorem that there are infinitely many prime numbers. Suppose that there are only finitely many and that these are the numbers p1 ,…,ps . Then we consider the number p1p2…ps+1. It contains none of the numbers p1 ,…,ps as a prime factor. Therefore, there must be still more primes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Koch, H. (1991). Prime numbers in arithmetic progressions. In: Introduction to Classical Mathematics I. Mathematics and Its Applications, vol 70. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3218-3_6
Download citation
DOI: https://doi.org/10.1007/978-94-011-3218-3_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7923-1238-3
Online ISBN: 978-94-011-3218-3
eBook Packages: Springer Book Archive