Primes with preassigned digits II
Glyn Harman, Imre Kátai (2008)
Acta Arithmetica
Similarity:
Glyn Harman, Imre Kátai (2008)
Acta Arithmetica
Similarity:
Glyn Harman (2006)
Acta Arithmetica
Similarity:
Dieter Wolke (2005)
Acta Arithmetica
Similarity:
Hongze Li, Hao Pan (2008)
Acta Arithmetica
Similarity:
Gustavo Funes, Damian Gulich, Leopoldo Garavaglia, Mario Garavaglia (2008)
Visual Mathematics
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:
Jan Mycielski (1989)
Colloquium Mathematicae
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).
Yingchun Cai, Minggao Lu (2003)
Acta Arithmetica
Similarity:
Christian Elsholtz (2003)
Acta Arithmetica
Similarity:
Chaumont, Alain, Müller, Tom (2006)
Journal of Integer Sequences [electronic only]
Similarity:
Hakan Ali-John Seyalioglu (2009)
Acta Arithmetica
Similarity:
Müller, Tom (2006)
Experimental Mathematics
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.
Alex Kontorovich (2014)
Annales de la faculté des sciences de Toulouse Mathématiques
Similarity:
We discuss the notion of a “Level of Distribution” in two settings. The first deals with primes in progressions, and the role this plays in Yitang Zhang’s theorem on bounded gaps between primes. The second concerns the Affine Sieve and its applications.
Douglas Hensley, Ian Richards (1974)
Acta Arithmetica
Similarity:
Danilo Bazzanella (2009)
Rendiconti del Seminario Matematico della Università di Padova
Similarity: