Primes and polynomials with restricted digits
From MaRDI portal
(Redirected from Publication:5089499)
Abstract: Let be a sufficiently large integer, and . We show there are infinitely many prime numbers which do not have the digit in their base expansion. Similar results are obtained for values of a polynomial (satisfying the necessary local conditions) and if multiple digits are excluded. Our proof is based on the Hardy-Littlewood circle method and Fourier analysis of the set of integers with no digit equal to in base .
Recommendations
Cited in
(15)- Primes, products and polynomials
- Primes with restricted digits
- Truncatable primes and unavoidable sets of divisors
- Irreducibility of random polynomials: general measures
- Missing digits and good approximations
- 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
- Distribution of integers with digit restrictions via Markov chains
- Squares with a positive proportion of preassigned digits
- Density results on hyperharmonic integers
- Truncated polynomials with restricted digits
- Bounds for exponential sums over integers with restricted digits
- Goldbach's problem in short intervals for numbers with a missing digit
- Reversed primes in arithmetic progressions for arbitrary bases
This page was built for publication: Primes and polynomials with restricted digits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089499)