PART 1: REPETITION CONTROL STRUCTURE (FOR) Instruction: Create a flowchart and 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 Nitself, 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. 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 5 is deficient. Input N: 18 18 is abundant. Input N: 28 28 is perfect.
PART 1: REPETITION CONTROL STRUCTURE (FOR) Instruction: Create a flowchart and 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 Nitself, 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. 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 5 is deficient. Input N: 18 18 is abundant. Input N: 28 28 is perfect.
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
Related questions
Question
PROBLEM: Repetition Control Structure (for)
SHOW THE CODES IN ANY JAVA APPLICATION LIKE JCRATOR AND ECLIPSE. OUTPUT SHOULD BE LIKE IN THE TABLE. INCLUDE ALSO ITS FLOWCHART
PLS INCLUDE THE FLOWCHARS PLS PLSS
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 5 images
Knowledge Booster
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.Recommended textbooks for you
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,