Jump to content

Perfect numbers: Difference between revisions

m
Implement in terms of the more general divisor_sum function.
m (Implement in terms of the more general divisor_sum function.)
Line 297:
using namespace std ;
 
boolint is_perfectdivisor_sum( int number ) ;{
int sum = 0 ;
for ( int i = 1 ; i < number ; i++ )
if ( number % i == 0 )
sum += i ;
return sum == number ;
}
 
int main( ) {
cout << "Perfect numbers from 1 to 33550337:\n" ;
for ( int num = 1 ; num < 33550337 ; num++ ) {
if ( is_perfectdivisor_sum( num ) == num)
cout << num << '\n' ;
}
return 0 ;
}
}</lang>
 
bool is_perfect( int number ) {
int sum = 0 ;
for ( int i = 1 ; i < number ; i++ )
if ( number % i == 0 )
sum += i ;
return sum == number ;
}</lang>
 
=={{header|Clojure}}==
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.