Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
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

 

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. 9. 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): I. Input N: 5 5 is deficient. Input N: 28 Input N: 18 28 is perfect. 18 is abundant. CamScanner
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. 9. 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): I. Input N: 5 5 is deficient. Input N: 28 Input N: 18 28 is perfect. 18 is abundant. CamScanner
Expert Solution
steps

Step by step

Solved in 5 steps with 5 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Computational Systems
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
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS