Primes from sums of two squares and missing digits

From MaRDI portal



Abstract: Let mathcalA′ 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 p=m2+ell2, with ellinmathcalA′. The proof draws on ideas from the work of Friedlander-Iwaniec on primes of the form p=x2+y4, as well as ideas from the work of Maynard on primes 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)