First Hardy–Littlewood conjecture: Difference between revisions
imported>Citation bot Altered pages. Added issue. Removed URL that duplicated identifier. Formatted dashes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Conjectures about prime numbers | #UCB_Category 28/33 |
(No difference)
|
Latest revision as of 15:43, 18 December 2024
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 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 denote the number of primes less than st. are all prime. ThenTemplate:SfnTemplate:Sfn
where
is a product over odd primes and denotes the number of distinct residues of modulo .
The case and is related to the twin prime conjecture. Specifically if denotes the number of twin primes less than n then
where
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
(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