Nested Loops
In this lab, we will leath to nse the following:
Selection Statements
Loops
Nested loops
Write a program that outputs the amount of deficient numbers, perfect numbers, and abundant numbers between 1 and some upper bound specified by the user. That's it! Get coding!
A proper divisor of a positive integer is a divisor that is strictly less than the number.
Ax. 20 has propet divisoss 1,2,4,5,8*10. While 20 is a divisor of itself, it is not a proper divisor
A perfect number is a positive integer that is equal to the sum of its proper divisors.
Ex. 6 has proper divisoes 1,2,8*3. The sum of there divisors is 6, making 6 a perfect number.
An abuadant number is a positive integer that is less than the sum of its proper divisors.
Ex. 18 has proper divisors 1,2,3,6,&9. The sum of these divisors is 21 , making 18 an abundant aumber:
A deficient number is a positive integer that is greater than the sum of its proper divisors.
Ex. 10 has proper divisors 1,2,&5. The sum of these divisors is 8 , making 10 a deficient number
Here is some sample output.