Some Notes on Digit Strings in the Primes
classification
🧮 math.NT
keywords
decimalprimesomestringwhosearbitrarilyarithmeticbound
read the original abstract
Let $S$ be a string of $l$ decimal digits. We give an explicit upper bound on some prime $p$ whose decimal representation contains the string $S$. We also show, as a corollary of the Green-Tao theorem, that there are arbitrarily long arithmetic progressions of prime numbers all of whose decimal representations contain $S$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.