Write a Java program that reads a positive, non-zero integer as input and checks if the...

Transcribed Image Text:

Write a Java program that reads a positive, non-zero integer as input and checks if the integer is deficient, perfect, or abundant. A positive, non-zero integer, N, is said to be perfect if the sum of its positive proper divisors (i.e.. the positive integers, other than N itself, that divide N exactly) is equal to the number itself. If this sum is less than N, the number is said to be deficient. If the sum is greater than N. the number is said to be abundant. The first few perfect numbers are 6, 28, 496, and 8128. Illustrations: Number 6 28 Factors of the number less than itself Sum of Factors 3,2.1 14, 7, 4, 2, 1 6 28 For example, the number 6 is perfect, since 6=1+2+3, the number 8 is deficient, since 8>1+2+4, while the number 12 is abundant, since 12 <1+2+3+4+6. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are calculated and printed by the program): Input N: 5 5 is deficient. Input N: 6 6 is perfect. Input N: 18 18 is abundant. Required: The flowchart, the java file (Family Name Perfect.java) containing the code and 3 image files (Sample1, Sample2 and Sample3) containing different sample input/output of the program. Write a Java program that reads a positive, non-zero integer as input and checks if the integer is deficient, perfect, or abundant. A positive, non-zero integer, N, is said to be perfect if the sum of its positive proper divisors (i.e.. the positive integers, other than N itself, that divide N exactly) is equal to the number itself. If this sum is less than N, the number is said to be deficient. If the sum is greater than N. the number is said to be abundant. The first few perfect numbers are 6, 28, 496, and 8128. Illustrations: Number 6 28 Factors of the number less than itself Sum of Factors 3,2.1 14, 7, 4, 2, 1 6 28 For example, the number 6 is perfect, since 6=1+2+3, the number 8 is deficient, since 8>1+2+4, while the number 12 is abundant, since 12 <1+2+3+4+6. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are calculated and printed by the program): Input N: 5 5 is deficient. Input N: 6 6 is perfect. Input N: 18 18 is abundant. Required: The flowchart, the java file (Family Name Perfect.java) containing the code and 3 image files (Sample1, Sample2 and Sample3) containing different sample input/output of the program.

Answer rating: 100% (QA)

Here is a Java program that reads a positive nonzero integer as input from the user and determines whether the number is deficient perfect or abundant import javautilScanner public class PerfectNumber public static void mainString args Scanner scanner new ScannerSystemin SystemoutprintInput N int num scannernextInt int sum 0 for int i 1 i num i if num i 0 sum i if sum num Systemoutprintlnnum is deficient else if sum num Systemoutprintlnnum is perfect else Systemoutprintlnnum is abundant In the program We take an input integer N from the user We calculate the sum of all positive proper divisors of N numbers less than N that divide N exactly Based on the comparison of the sum with N we determine ... View the full answer