Math Fundamentals18 sections · 814 units
Open in Course

Perfect Number - Algorithm

(Sum proper divisors)

1.1. If num <= 1, return false (no perfect numbers below 2).

2.2. Initialize sum = 1 (1 is always a proper divisor).

3.3. Loop i from 2 to √num. If num % i == 0, add i to sum. If i != num/i and num/i != num, add num/i to sum.

4.4. Return sum == num.