|
g:= proc(n) local t, L, i, j;
t:= n;
for i from 0 while isprime(t) do
L:= convert(2*t, base, 10);
t:= add(L[-j]*10^(j-1), j=1..nops(L));
od;
i
end proc:
V:= Vector(6): count:= 0: p:= 1:
while count < 6 do
p:= nextprime(p); v:= g(p);
if V[v] = 0 then V[v]:= p; count:= count+1 fi
od:
convert(V, list);
| 