|
MAPLE
|
f:= proc(d) local R, q, F, G, s, t, a, u, i;
q:= 2*10^d+1;
F:= ifactors(q)[2];
G:= map(t -> [t[1], floor(t[2]/2)], F);
s:= mul(t[1]^t[2], t=G);
R:= NULL:
for a in numtheory:-divisors(s) do
u:= q/a^2;
R:= R, seq(i^2*u, i=ceil(sqrt(10^(d-1)/u))..floor(sqrt((10^d-1)/u)))
od;
R
end proc:
|