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 Nexactly) 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 Factors of the number less than itself | Sum of Factors 3. 2, 1 14, 7, 4, 2, 1 6 28 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 Input N: 6 Input N: 18 5 is deficient. 6 is perfect. 18 is abundant.

C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter5: Repetition Statements
Section: Chapter Questions
Problem 7PP
icon
Related questions
Question
REPETITION CONTROL STRUCTURE (FOR)
Instruction:
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
Factors of the number less than itself Sum of Factors
3, 2, 1
14, 7, 4, 2, 1
6
6
28
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
Input N: 6
Input N: 18
5 is deficient.
6 is perfect.
18 is abundant.
Required: The java file (FamilyName_Perfect.java) containing the code and 3 image files
(Sample1, Sample2 and Sample3) containing different sample input/output of the
program.
Transcribed Image Text:REPETITION CONTROL STRUCTURE (FOR) Instruction: 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 Factors of the number less than itself Sum of Factors 3, 2, 1 14, 7, 4, 2, 1 6 6 28 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 Input N: 6 Input N: 18 5 is deficient. 6 is perfect. 18 is abundant. Required: The java file (FamilyName_Perfect.java) containing the code and 3 image files (Sample1, Sample2 and Sample3) containing different sample input/output of the program.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Adjacency Matrix
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Microsoft Visual C#
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning