Search:

Proper divisors of a number is its factors other than itself.
The program should compute the sum first in order to identify whether the number is perfect, deficient or abundant.

Can you point...

The integer is perfect if the sum of its positive proper divisors is equal to the number itself.
If this sum is less than the integer, the numbers is deficient.
If the sum is greater than the...

the number can only be one of them

I need to make a java program that will read an input positive integer and then checks if it is a perfect, deficient or abundant number using the for-loop.
for example: 6 is a perfect number since...

/*A positive, non-zero integer, N, is said to be perfect if the sum of its positive proper divisors is equal to the number itself. If this sum is less than N, the numbers is said to be deficient. If...