Hostname: page-component-77c89778f8-fv566 Total loading time: 0 Render date: 2024-07-19T15:36:52.578Z Has data issue: false hasContentIssue false

Infinitely many primes in arithmetic progressions: the cyclotomic polynomial method

Published online by Cambridge University Press:  01 August 2016

Shay Gueron
Affiliation:
Department of Mathematics, University of Haifa, Haifa, 31905, Israel, shay@math.haifa.ac.il
Ran Tessler
Affiliation:
Department of Mathematics, University of Haifa, Haifa, 31905, Israel, shay@math.haifa.ac.il

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Copyright
Copyright © The Mathematical Association 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Dickson, L. E. Modern elementary theory of numbers, University of Chicago Press (1939).Google Scholar
2. Selberg, A. An elementary proof of Dirichlet’s theorem about primes in an arithmetic progression, Ann. of Math. 50 (1949) pp. 297304.Google Scholar
3. Bateman, P. Low, M. E. Prime numbers in arithmetic progression with difference 24, Amer. Math. Monthly, 72 (1965) pp. 139143.CrossRefGoogle Scholar
4. Hua, C. Introduction to number theory, Springer-Verlag, New York (1982).Google Scholar
5. Esmonde, J. and Murty, M. R. Problems in algebraic number theory, Springer (1999).Google Scholar
6. Sierpinski, W. Elementary theory of numbers, North Holland, Amsterdam (1988).Google Scholar
7. Murty, R. Primes in certain arithmetic progressions, J. Madras Univ. Section B 51 (1988) pp. 161169.Google Scholar
8. Shklarsky, D. O. Yaglom, N. N. Yaglom, I. M. The USSR Olympiads Problem book, Dover, New York (1993).Google Scholar
9. Nagell, T. Introduction to number theory, Chelsea, NewYork (1981).Google Scholar