Definition:Left-Truncatable Prime

From ProofWiki
Jump to navigation Jump to search

Definition

A left-truncatable prime is a prime number which remains prime when any number of digits are removed from the left hand end.

Zeroes are excluded, in order to eliminate, for example, prime numbers of the form $10^n + 3$ for arbitrarily large $n$.


Sequence

The sequence of left-truncatable primes begins:

$2, 3, 5, 7, 13, 17, 23, 37, 43, 47, 53, 67, 73, 83, 97, 113, 137, 167, 173, 197, \ldots$


Examples

$357 \, 686 \, 312 \, 646 \, 216 \, 567 \, 629 \, 137$ is a Left-Truncatable Prime

The largest left-truncatable prime is $357 \, 686 \, 312 \, 646 \, 216 \, 567 \, 629 \, 137$.


Also see

  • Results about left-truncatable primes can be found here.


Sources