Perfect Numbers

This week's function is for checking if an integer is a perfect number.

ASP

1. function isPerfect(someNumber)
2.     dim i
3.     dim arrFactors
4.     arrFactors = Array()
6.     ' Only positive integers can be perfect.
7.     if someNumber < 1 then
8.         isPerfect = false
9.         exit function
10.     end if
12.     ' Calculate the factors for the given number.
13.     for i = 1 to someNumber
14.         if someNumber mod i = 0 then
15.             redim preserve arrFactors(UBound(arrFactors) + 1)
16.             arrFactors(UBound(arrFactors)) = i
17.         end if
18.     next
20.     ' A perfect number is a number that is half the sum of all of its positive divisors (including itself).
21.     if someNumber = eval(join(arrFactors, " + ")) / 2 then
22.         isPerfect = true
23.     else
24.         isPerfect = false
25.     end if
26. end function

PHP

1. function isPerfect($number)
2. {
3.     // Only positive integers can be perfect.
4.     if ($number < 1)
5.     {
6.         return false;
7.     }
9.     // Calculate the factors for the given number.
10.     for($i = 1; $i <= $number; $i++)
11.     {
12.         if ($number % $i == 0)
13.         {
14.             $arrFactors[] = $i;
15.         }
16.     }
18.     // A perfect number is a number that is half the sum of all of its positive divisors (including itself).
19.     return ($number == array_sum($arrFactors) / 2) ? true : false;
20. }

• View ASP implementation on Snipplr
• View PHP implementation on Snipplr