13 lines
161 B
Text
13 lines
161 B
Text
|
fn isPerfect n =
|
||
|
|
(
|
||
|
|
local sum = 0
|
||
|
|
for i in 1 to (n-1) do
|
||
|
|
(
|
||
|
|
if mod n i == 0 then
|
||
|
|
(
|
||
|
|
sum += i
|
||
|
|
)
|
||
|
|
)
|
||
|
|
sum == n
|
||
|
|
)
|