Some Notes on Digit Strings in the Primes

preprint2014arXivOpen access

Abstract

Let SS be a string of ll decimal digits. We give an explicit upper bound on some prime pp whose decimal representation contains the string SS. 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 SS.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.