with(numtheory);
T:=proc(t) local j, w, x, y; x:=t; y:=[]; while x>0 do
y:=[x mod 10, op(y)]; x:=trunc(x/10); od; w:=(y[nops(y)]+y[1]) mod 10;
x:=0; for j from 1 to nops(y)-1 do x:=x*10+((y[j]+y[j+1]) mod 10); od; x:=x*10+w; end:
P:=proc(q) local a, b, n, v; v:=array(0..50);
for n from 0 to 50 do v[n]:=0; od; v[0]:=2; lprint(0, 2);
for n from 1 by 2 to q do if isprime(n) then b:=-1; a:=n;
while isprime(a) do b:=b+1; a:=T(a); od; if v[b]=0 then
v[b]:=n; lprint(b, n); fi; fi; od; end: P(10^10);
|