## Quiz 1: A Perfect Number

*Remember to create a fork copy of the Quiz file from the class repository and clone it in GitHub. Once you have finished, commit and push your solution up to your account. Submit a pull request to hand it in. Create a Java Main Class and name it Quiz1 in your project. Your project may be automarked for a portion of test cases. If your filename does not match or your output does not match, the automarked portion will fail!*A positive integer n is said to be perfect if the sum of its divisors is equal to twice the number. For instance 6 is a perfect number because 1 + 2 + 3 + 6 = 12 which is 2*6. A positive integer n is said to be deficient if the sum of its divisors is less than twice the number. 4 is deficient since 1 + 2 + 4 = 7 which is less than 2*4=8. Lastly, a positive integer is said to be abundant if the sum of its divisors is greater than twice the number. 12 is an abundant number since 1 + 2 + 3 + 4 + 6 + 12 = 28 which is greater than 2*12=24.

Write a program that repeatedly reads a positive integer, determines if the integer is

*deficient*,

*perfect*, or

*abundant*, and outputs the number along with its classification. Your program should continue to ask for integers to classify and stop when it reads in a 0. Your solution should match the sample run below. Output text is shown in RED and input text is shown in BLUE

## Sample

**Enter in a number to classify**

6

**6 is a perfect number**

**Enter in a number to classify**

12

**12 is an abundant number**

**Enter in a number to classify**

15

**15 is a deficient number**

**Enter in a number to classify**

0

You will be graded using all portions of the CompSci Rubric, except for the Modularity section.