OFFSET
1,1
COMMENTS
These numbers are called Caesar primes because the birth date of Julius Caesar (July 13th) provides one example of such a number, i.e. p=7 and q=13 give the prime 137.
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
MATHEMATICA
lim=2700; plim=Max[FromDigits[Rest[IntegerDigits[lim]]], FromDigits[Drop[IntegerDigits[lim], -1]]]; f2p[{p_, q_}]:=FromDigits[Join[IntegerDigits[q], IntegerDigits[p]]]; p=Prime[Range[PrimePi[plim]]]; p2=Subsets[p, {2}]; Union[Select[f2p/@p2, PrimeQ[#]&&#<=lim&]] (* James C. McMahon, Mar 12 2025 *)
PROG
(Python)
from sympy import isprime
def ok(n):
if not isprime(n): return False
s = str(n)
return any(s[i]!='0' and (q:=int(s[:i])) > (p:=int(s[i:])) and isprime(q) and isprime(p) for i in range(1, len(s)))
print([k for k in range(2800) if ok(k)]) # Michael S. Branicky, Apr 05 2025
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Tom Mueller (muel4503(AT)uni-trier.de), Dec 17 2007
EXTENSIONS
a(27)-a(47) from James C. McMahon, Mar 12 2025
STATUS
approved
