Primes in tuples and Romanoff's theorem

Cite item

Full Text

Open Access
Restricted Access

Access granted
Restricted Access

Subscription Access

A lower bound for the number of primes in tuplesis obtained. As an application, a lower bound for the Romanoff type representation functionsis given.

prime number, Bombieri–Vinogradov type theorem, representation function, primes in tuples, Romanoff's theorem

HSE University, Moscow

Author for correspondence.
Email: artyom.radomskii@mail.ru
Candidate of physico-mathematical sciences, Researcher

Yitang Zhang, “Bounded gaps between primes”, Ann. of Math. (2), 179:3 (2014), 1121–1174
J. Maynard, “Small gaps between primes”, Ann. of Math. (2), 181:1 (2015), 383–413
J. Maynard, “Dense clusters of primes in subsets”, Compos. Math., 152:7 (2016), 1517–1554
Yong-Gao Chen, Yuchen Ding, “Quantitative results of the Romanov type representation functions”, Q. J. Math., 74:4 (2023), 1331–1359
N. P. Romanoff, “Über einige Sätze der additiven Zahlentheorie”, Math. Ann., 109:1 (1934), 668–678
P. Erdős, “On integers of the form $2^k+p$ and some related problems”, Summa Brasil. Math., 2 (1950), 113–123
Yong-Gao Chen, Yuchen Ding, “On a conjecture of Erdős”, C. R. Math. Acad. Sci. Paris, 360 (2022), 971–974
Г. Дэвенпорт, Мультипликативная теория чисел, Наука, М., 1971, 200 с.
M. Ram Murty, Problems in analytic number theory, Grad. Texts in Math., 206, Read. Math., 2nd ed., Springer, New York, 2008, xxii+502 pp.
А. О. Радомский, “Последовательные простые числа на коротких интервалах”, Труды МИАН, 314, Аналитическая и комбинаторная теория чисел (2021), 152–210

Supplementary Files

Action

1. JATS XML