Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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 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. Factors of the number less than itself | Sum of Factors 3, 2, 1 14, 7, 4, 2, 1 6 | 28 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: 28 Input N: 18 S is deficient. 28 is perfect. 18 is abundant. Required: The flowchart, 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.

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

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

put comments on what each line does and make a flowchart

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 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. 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: 28 28 is perfect. Input N: 18 18 is abundant. Required: The flowchart, 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: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 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. 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: 28 28 is perfect. Input N: 18 18 is abundant. Required: The flowchart, 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
steps

Step by step

Solved in 4 steps with 5 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS