|
%I #27 Sep 05 2021 08:13:03
%S 7810223,19579907,909001523,984960937,78406036607,90124536947,
%T 99020400307,190002706337,393086079907,500708906197,509000702017,
%U 600180367883,780430098443,3534900290107,5046024021013,6006006800743,6009000432797,9001924501223,12090900340283
%N Digitally delicate truncatable primes: every suffix is prime, changing any one decimal digit always produces a composite number, except the first to zero.
%C These prime numbers are both:
%C - digitally delicate primes (also called weakly prime numbers) A158124: changing any one decimal digit always produces a composite number, with restriction that first digit may not be changed to a 0 (that means no change of the number of significant digits from its original value).
%C - left-truncatable primes A033664: every suffix is prime, means repeatedly deleting the most significant digit gives a prime at every step until a single-digit prime remains.
%H Michael S. Branicky, <a href="/A347424/b347424.txt">Table of n, a(n) for n = 1..9175</a> (all terms with <= 29 digits)
%o (Python)
%o from sympy import isprime, primerange
%o def is_digitally_delicate(p):
%o s = str(p)
%o for i in range(len(s)):
%o for d in "0123456789":
%o if d != s[i] and not (i == int(d) == 0):
%o if isprime(int(s[:i] + d + s[i+1:])): return False
%o return True
%o def A033664gen(maxdigits):
%o yield from [2, 3, 5, 7]
%o primestrs, digits, d = ["2", "3", "5", "7"], "0123456789", 1
%o while len(primestrs) > 0 and d < maxdigits:
%o cands = (d+p for p in primestrs for d in "0123456789")
%o primestrs = [c for c in cands if c[0] == "0" or isprime(int(c))]
%o yield from sorted(map(int, (p for p in primestrs if p[0] != "0")))
%o d += 1
%o def afind(maxdigits):
%o for p in A033664gen(maxdigits):
%o if is_digitally_delicate(p): print(p, end=", ")
%o afind(12) # _Michael S. Branicky_, Sep 01 2021
%Y Cf. A158124, A033664.
%K nonn,base
%O 1,1
%A _Marc Morgenegg_, Sep 01 2021
%E a(3)-a(4) from _Amiram Eldar_, Sep 01 2021
%E a(5)-a(19) from _Michael S. Branicky_, Sep 01 2021
| 