23 lines
364 B
Text
23 lines
364 B
Text
|
sub sumDivs(n)
|
||
|
|
local sum, d
|
||
|
|
|
||
|
|
sum = 1
|
||
|
|
|
||
|
|
for d = 2 to sqrt(n)
|
||
|
|
if not mod(n, d) then
|
||
|
|
sum = sum + d
|
||
|
|
sum = sum + n / d
|
||
|
|
end if
|
||
|
|
next
|
||
|
|
return sum
|
||
|
|
end sub
|
||
|
|
|
||
|
|
for n = 2 to 20000
|
||
|
|
m = sumDivs(n)
|
||
|
|
if m > n then
|
||
|
|
if sumDivs(m) = n print n, "\t", m
|
||
|
|
end if
|
||
|
|
next
|
||
|
|
|
||
|
|
print : print peek("millisrunning"), " ms"
|