期刊名称：Computational Methods in Science and Technology
印刷版ISSN：1505-0602
出版年度：2019
卷号：25
期号：3
页码：143
DOI：10.12921/cmst.2019.0000033
出版社：Poznan Supercomputing and Networking Center
摘要：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.
其他关键词：prime k-tuple, asymptotic density, conjecture, Skewes number
