Some Notes on Digit Strings in the Primes
Number Theory
2014-07-31 v2
Abstract
Let be a string of decimal digits. We give an explicit upper bound on some prime whose decimal representation contains the string . 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 .
Cite
@article{arxiv.1407.7324,
title = {Some Notes on Digit Strings in the Primes},
author = {Adrian Dudek},
journal= {arXiv preprint arXiv:1407.7324},
year = {2014}
}
Comments
7 pages, 1 table; feedback welcome!