RosettaCodeData/Task/Perfect-numbers/Nim/perfect-numbers.nim
2016-12-05 23:44:36 +01:00

12 lines
248 B
Nim

import math
proc isPerfect(n: int): bool =
var sum: int = 1
for i in 2 .. <(n.toFloat.sqrt+1).toInt:
if n mod i == 0:
sum += (i + n div i)
return (n == sum)
for i in 2..10_000:
if isPerfect(i):
echo(i)