On truncatable primes

I. O. Angell, H. J. Godwin · Mathematics of Computation · 1977

Truncatable primes are those that yield a sequence of primes when digits are removed always from the left or always from the right. The sizes of the largest truncatable primes in a given number base are estimated by a probabilistic argument and compared with computed values.

Read the paper · More papers on PaperTik