REPETITION CONTROL STRUCTURE (FOR)Instruction:Write a Java program that reads a positive, non-zero integer as input and checks if theinteger 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 numberitself. If this sum is less than N, the number is said to be deficient. If the sum is greater thanN, the number is said to be abundant.The first few perfect numbers are 6, 28, 496, and 8128.Illustrations:NumberFactors of the number less than itself Sum of Factors3, 2, 114, 7, 4, 2, 1662828For example, the number 6 is perfect, since 6 = 1 + 2 + 3, the number 8 is deficient, since8 >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 boldcharacters are input from the user, while the items in bold italic are calculated andprinted by the program):Input N: 5Input N: 6Input N: 185 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 theprogram.

Actually, java is a object oriented programming language. It is a platform independent.

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.

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.

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

Similar questions

Write a program using Java programming language that reads one integer number and outputs (writes) the sum of all numbers that are lower or equal to this number and that are divisible by 5
code in java onlyy
Suppose that among the four (4) digit (abcd) positive integers, those that have the property of multiplying the first two digits and the last two digits, equaling the product of the substituted form of their digits (ab * cd = ba * dc), are called Inverted Numbers. Write the program with java that says whether a 4-digit number entered from the keyboard is a Reverse Number.
Write a recursive function in Java that accepts an integer as input and returns 1 + 1/2 + 3 + 1/4 + ...(n or 1/n). The answer is the sum of the odd integers from 1 to n plus the sum of the reciprocals of the even integers.
Exercise 1Write a Java method random that generates and returns a random number between 14 and 59(using SecureRandom). Test your method several times using a main function
The table below shows five hundred individuals who were divided into two categories three and four as shown in the table below; Serial 1 2 3 4 TOTAL 1 36 16 14 34 100 2 64 34 20 82 200 3 50 50 16 84 200 Total 150 100 50 200 500 Write a code to test Using the Chi-square test if there is independence between the two individuals. In any language preferrably Java, Python or MatLab
In JAVA
write in java
Write a Java program that uses two nested for loops and the modulus operator (%) to detect and print all prime numbers from 1 to 10,000. Prime numbers are integral numbers that are only evenly divisible by themselves and one (1). Display all the prime numbers found.
Solve using java language, while loop is not allowed
Write a Java program Consider the structure of three examples of inputs and outputs that are given in the first picture The structure of the code must be as it is shown in the second picture Instructions of the task: Write a program that takes input 10 integer numbers and stores in an array. Afterward, decide whether this array can be balanced or not an output "Can be balanced" or "Cannot be balanced". An array is balanced if there is a place to split the array so that the sum of the numbers on one side is equal to the sum of the numbers on the other side.