Primes from sums of two squares and missing digits
From MaRDI portal
Abstract: Let be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form , with . The proof draws on ideas from the work of Friedlander-Iwaniec on primes of the form , as well as ideas from the work of Maynard on primes with restricted digits.
Recommendations
Cited in
(13)- Almost primes whose expansion in base \(r\) misses some digits
- Coordinate distribution of Gaussian primes
- scientific article; zbMATH DE number 2162674 (Why is no real title available?)
- The polynomials X2+(Y2+1)2$X^2+(Y^2+1)^2$ and X2+(Y3+Z3)2$X^{2} + (Y^3+Z^3)^2$ also capture their primes
- Primes with a missing digit: Distribution in arithmetic progressions and an application in sieve theory
- Reversible primes
- Character sums over sparse elements of finite fields
- Gaussian primes
- On the distribution of special multiplicative functions in sets of integers with restricted digits
- Discrepancies in the distribution of Gaussian primes
- On Gaussian primes in sparse sets
- Truncated polynomials with restricted digits
- Bounds for exponential sums over integers with restricted digits
This page was built for publication: Primes from sums of two squares and missing digits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108179)