In number theory, the first Hardy–Littlewood conjecture states the asymptotic formula for the number of prime k-tuples less than a given magnitude by generalizing the prime number theorem. It was first proposed by G. H. Hardy and John Edensor Littlewood in 1923.

Statement

Let be positive even integers such that the numbers of the sequence do not form a complete residue class with respect to any prime and let \pi_{P}(n) denote the number of primes p less than n st. are all prime. Then where is a product over odd primes and denotes the number of distinct residues of modulo q. The case k=1 and m_1=2 is related to the twin prime conjecture. Specifically if \pi_2(n) denotes the number of twin primes less than n then where is the twin prime constant.

Skewes' number

The Skewes' numbers for prime k-tuples are an extension of the definition of Skewes' number to prime k-tuples based on the first Hardy–Littlewood conjecture. The first prime p that violates the Hardy–Littlewood inequality for the k-tuple P, i.e., such that (if such a prime exists) is the Skewes number for P.

Consequences

The conjecture has been shown to be inconsistent with the second Hardy–Littlewood conjecture.

Generalizations

The Bateman–Horn conjecture generalizes the first Hardy–Littlewood conjecture to polynomials of degree higher than 1.