revdigs:= proc(n) local L, i;
L:= convert(n, base, 10);
add(L[-i]*10^(i-1), i=1..nops(L))
end proc:
f:= proc(n) local r, t, x;
x:= n;
for t from 0 do
if not isprime(x) then return t fi;
r:= revdigs(x);
if not (r <> n and isprime(x) and isprime(r)) then return t fi;
x:= x+r+1;
od;
end proc:
V:= Vector(4): V[1]:= 13: count:= 1:
for n from 17 by 6 while count < 4 do
v:= f(n);
if v > 0 and V[v] = 0 then V[v]:= n; count:= count+1 fi;
od:
convert(V, list);
|