17 lines
379 B
Text
17 lines
379 B
Text
program amicable_pairs;
|
|
p := propDivSums(20000);
|
|
|
|
loop for [n,m] in p | n = p(p(n)) and n<m do
|
|
print([n,m]);
|
|
end loop;
|
|
|
|
proc propDivSums(n);
|
|
divs := {};
|
|
loop for i in [1..n] do
|
|
loop for j in [i*2, i*3..n] do
|
|
divs(j) +:= i;
|
|
end loop;
|
|
end loop;
|
|
return divs;
|
|
end proc;
|
|
end program;
|