Prime Number Races
Andrew Granville, Greg Martin
Abstract
This is a survey article on prime number races. Chebyshev noticed in the first half of the nineteenth century that for any given value of x, there always seem to be more primes of the form 4n+3 less than x then there are of the form 4n+1. Similar observations have been made with primes of the form 3n+2 and 3n+1, with primes of the form 10n+3/10n+7 and 10n+1/10n+9, and many others besides. More generally, one can consider primes of the form qn+a, qn+b, qn+c, >... for our favorite constants q, a, b, c, ... and try to figure out which forms are "preferred" over the others. In this paper, we describe these phenomena in greater detail and explain the efforts that have been made at understanding them.
Create a lesson
Related papers
An Infinite Family of Apéry-like Recurrences for Euler's Constant
Rotem Kalisch, Tali Monderer, Elyasheev Leibtag et al.
On the saturability of p-adic Lie groups
Casey Perdue
On Divisor Function Polynomials and Dirichlet Series
Martin N. Huxley, Matthew C. Lettington, Karl Michael Schmidt
On a conjecture on Romanoff type representations
Xiao-Hui Yan
Regularization of a Divergent Arithmetic Product via the Asymptotic Monoid: The Case of (-1)ω(n)
A. Alvarez Cruz, E. A. Alvarez Gutierrez
Appell Sequences in Analytic Number Theory: Shifted Expansions and Dirichlet L-Functions
Abdelmejid Bayad