Primes with preassigned digits II
Glyn Harman, Imre Kátai (2008)
Acta Arithmetica
Similarity:
Glyn Harman, Imre Kátai (2008)
Acta Arithmetica
Similarity:
Daniel Alan Goldston, János Pintz, Cem Yalçın Yıldırım (2013)
Acta Arithmetica
Similarity:
We prove that given any small but fixed η > 0, a positive proportion of all gaps between consecutive primes are smaller than η times the average gap. We show some unconditional and conditional quantitative results in this vein. In the results the dependence on η is given explicitly, providing a new quantitative way, in addition to that of the first paper in this series, of measuring the effect of the knowledge on the level of distribution of primes.
Glyn Harman (2006)
Acta Arithmetica
Similarity:
Jörg Brüdern, Koichi Kawada (2011)
Colloquium Mathematicae
Similarity:
A new method for counting primes in a Beatty sequence is proposed, and it is shown that an asymptotic formula can be obtained for the number of such primes in a short interval.
Kaisa Matomäki (2009)
Acta Arithmetica
Similarity:
Yingchun Cai, Minggao Lu (2003)
Acta Arithmetica
Similarity:
Gustavo Funes, Damian Gulich, Leopoldo Garavaglia, Mario Garavaglia (2008)
Visual Mathematics
Similarity:
Roger C. Baker, Liangyi Zhao (2016)
Acta Arithmetica
Similarity:
We study the gaps between primes in Beatty sequences following the methods in the recent breakthrough by Maynard (2015).
Dieter Wolke (2005)
Acta Arithmetica
Similarity:
Hakan Ali-John Seyalioglu (2009)
Acta Arithmetica
Similarity:
Deniz A. Kaptan (2016)
Acta Arithmetica
Similarity:
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
Akshaa Vatwani (2018)
Czechoslovak Mathematical Journal
Similarity:
We develop an axiomatic formulation of the higher rank version of the classical Selberg sieve. This allows us to derive a simplified proof of the Zhang and Maynard-Tao result on bounded gaps between primes. We also apply the sieve to other subsequences of the primes and obtain bounded gaps in various settings.
Enxun Huang (2023)
Czechoslovak Mathematical Journal
Similarity:
It is proved that every pair of sufficiently large odd integers can be represented by a pair of equations, each containing two squares of primes, two cubes of primes, two fourth powers of primes and 105 powers of 2.
Christian Elsholtz (2003)
Acta Arithmetica
Similarity:
Jan Mycielski (1989)
Colloquium Mathematicae
Similarity:
Yong-Gao Chen, Li-Xia Dai (2007)
Acta Arithmetica
Similarity:
Jan-Christoph Puchta (2003)
Acta Arithmetica
Similarity:
Florian Luca, Ayyadurai Sankaranarayanan (2006)
Acta Arithmetica
Similarity: