RosettaCodeData/Task/Perfect-numbers/MAXScript/perfect-numbers.max

fn isPerfect n =
(
    local sum = 0
    for i in 1 to (n-1) do
    (
        if mod n i == 0 then
        (
            sum += i
        )
    )
    sum == n
)