$\begingroup$

There are many primes which have digits only from the set of one digit primes $\mathcal S_p = \{2,3,5,7\}$, but can we prove that there exists at least one $p$ for each $n$: $10^n \leq p \leq10^{n+1}$, $n\in \mathbb N$ with digits only in $\mathcal S_p$?

some first few examples $$7, 23, 257, 2357, \cdots$$

It feels like something easy to verify for many $n$ but difficult to prove for all.

---

EDIT This is not the same question as the duplicate marker at all. It asks about primes of all sizes, not only three digit and only asks about solely being built up by single-digit primes.

$\endgroup$ 10

1 Answer

$\begingroup$

In 2016 James Maynard proved that there are infinite number of primes without using one digit and he got the EMS award for it, if your conjecture was correct then that would be a stronger statement then his.

On the other hand it would probably be easier to prove that there are only finite repunit primes (primes which have only $1$'s in their decimal representation) then that there are only finite primes with having $2,3,5,7$ as their only digits.

According to Prime number theorem and the OEIS sequence it seems rather unlikely that if there are infinite number of such primes that there isn't at least one with $n$ digits

$\endgroup$

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password Submit

Post as a guest

Post Your Answer Discard

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy