2000 character limit reached
On The Asymptotic Density Of Prime k-tuples and a Conjecture of Hardy and Littlewood (1910.02636v1)
Published 7 Oct 2019 in math.NT
Abstract: In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
