Primes with preassigned digits
Glyn Harman (2006)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Primes with preassigned digits II”
Primes with preassigned digits
Primes in tuples IV: Density of small gaps between consecutive primes
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.
Hidden Symmetries Among Primes
Gustavo Funes, Damian Gulich, Leopoldo Garavaglia, Mario Garavaglia (2008)
Visual Mathematics
Similarity:
The localisation of primes in arithmetic progressions of irrational modulus
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.
Primes with preassigned digits
Dieter Wolke (2005)
Acta Arithmetica
Similarity:
A note on primes of the form p=aq² + 1
Kaisa Matomäki (2009)
Acta Arithmetica
Similarity:
Gaps between primes in Beatty sequences
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).
Primes and power-primes
Jan Mycielski (1989)
Colloquium Mathematicae
Similarity:
Sequences with bounded l.c.m. of each pair of terms, III
Yong-Gao Chen, Li-Xia Dai (2007)
Acta Arithmetica
Similarity:
On cluster primes
Christian Elsholtz (2003)
Acta Arithmetica
Similarity:
On the upper bound for π₂(x)
Yingchun Cai, Minggao Lu (2003)
Acta Arithmetica
Similarity:
All elite primes up to 250 billion.
Chaumont, Alain, Müller, Tom (2006)
Journal of Integer Sequences [electronic only]
Similarity:
Levels of Distribution and the Affine Sieve
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.
On the moments of the Carmichael λ function
Florian Luca, Ayyadurai Sankaranarayanan (2006)
Acta Arithmetica
Similarity:
The Goldston-Pintz-Yıldırım sieve and maximal gaps
Hakan Ali-John Seyalioglu (2009)
Acta Arithmetica
Similarity:
Primes of the form [cP].
R.C. Baker, G. Harman (1996)
Mathematische Zeitschrift
Similarity:
Searching for large elite primes.
Müller, Tom (2006)
Experimental Mathematics
Similarity:
A note on small gaps between primes in arithmetic progressions
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.
The Romanoff theorem revisited
Hongze Li, Hao Pan (2008)
Acta Arithmetica
Similarity: