First Hardy–Littlewood conjecture

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Infobox mathematical statement

In number theory, the first Hardy–Littlewood conjectureTemplate:Sfn 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.[1]

Statement

Let m1,m2,,mk be positive even integers such that the numbers of the sequence P=(p,p+m1,p+m2,,p+mk) do not form a complete residue class with respect to any prime and let πP(n) denote the number of primes p less than n st. p+m1,p+m2,,p+mk are all prime. ThenTemplate:SfnTemplate:Sfn

πP(n)CP2ndtlogk+1t,

where

CP=2kq prime,q31w(q;m1,m2,,mk)q(11q)k+1

is a product over odd primes and w(q;m1,m2,,mk) denotes the number of distinct residues of 0,m1,m2,,mk modulo q.

The case k=1 and m1=2 is related to the twin prime conjecture. Specifically if π2(n) denotes the number of twin primes less than n then

π2(n)C22ndtlog2t,

where

C2=2q prime,q3(11(q1)2)1.320323632

is the twin prime constant.Template:Sfn

Skewes' number

Template:Main article 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

πP(p)>CPliP(p),

(if such a prime exists) is the Skewes number for P.Template:Sfn

Consequences

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

Generalizations

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

Notes

Template:Reflist

References

Template:Prime number conjectures