Perfect numbers: Difference between revisions

Content added Content deleted
(Remove unnecessary iteration and logically redundant test (if [sum == 2 * num] then [sum - num == num] for all positive num anyway).)
(Remove unnecessary iteration and logically redundant test (if [sum == 2 * num] then [sum - num == num] for all positive num anyway).)
Line 202:
bool is_perfect( int number ) {
int sum = 0 ;
for ( int i = 1 ; i < number + 1 ; i++ )
if ( number % i == 0 )
sum += i ;
return ( ( sum == 2 * number ) || ( sum - number == number ) ) ;
}</lang>