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

See similar textbooks

Similar questions

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…
Language: JAVA Problem 1: Decimal to Binary Conversion Write a program that takes an integer value as an input and converts that value to its binary representation; for instance, if the user inputs 17, then the output will be 10001. Do not forget to check for valid input, which means if the user inputs a type of data other than an integer re-prompt the user to enter a valid value. The output binary number can be a string. Sample input and output: Enter an integer > a You entered an invalid type. Try again. Enter an integer > 17 10001
Exponent y Catherine Arellano mplement a recursive function that returns he exponent given the base and the result. for example, if the base is 2 and the result is 3, then the output should be 3 because the exponent needed for 2 to become 8 is 3 (i.e. 23 = 8) nstructions: 1. In the code editor, you are provided with a main() function that asks the user for two integer inputs: 1. The first integer is the base 2. The second integer is the result 2. Furthermore, you are provided with the getExponent() function. The details of this function are the following: 1. Return type - int 2. Name - getExponent 3. Parameters 1. int - base 2. int - result 4. Description - this recursive function returns the exponent 5. Your task is to add the base case and the general case so it will work Score: 0/5 Overview 1080 main.c exponent.h 1 #include 2 #include "exponent.h" 3 int main(void) { 4 int base, result; 5 6 printf("Enter the base: "); scanf("%d", &base); 7 8 9 printf("Enter the result: ");…
JAVA LANGUAGE CODE Postfix Calculator by CodeChum Admin One good implementation of computing infix expressions is to transform them to postfix and then evaluate via the postfix expression. Infix expressions is the common way of writing arithmetic expressions. The binary operator come between them as shown below: 2 * 5 + 9 - 10 / 20 In postfix expressions, the operands come first before the operator: 2 5 * 9 + 10 20 / - A stack can be used to evaluate postfix expressions. The operands are pushed onto the Stack and when an operator is found two operands are popped and the operation is performed and finally the result is pushed back onto the Stack. The final answer will be the lone element of the Stack. Input The first line contains a positive integer n representing the number of postfix expressions. What follows are n postfix expressions themselves. 5 10 20 + 30 15 2 * + 100 20 30 + / 90 20 10 + + 0 / 9 3 - 10 + 2 * Output A single line containing the result of…
Code using C++ Apply Fuctions and Arrays Instruction: 1. Create a Library System that allowed students to borrow and return books. 2. Ask for inputs like Name, Year Level, Student Number, Course, Number of books borrowed, date borrowed and due dates. 3. For each student, they can only borrow upto 5 books. The system should input the Title of the books as well. 4. The system should detect if any information is not provided by the user, it also detect if more than 5 books are borrowed. 5. The system can determine if the returned book/s is/are late and should give penalty of 5.00 per each book. 6. Make sure to provide a summary of all the inputs and reminders for the student.
Computer Science QuestionIn input you are provided with two words of the same length. Each word contains only lower-case alphabets. A shift operation will remove the first character of a word and add the same character at the end of that word. Your goal is to develop a python program that outputs the number of shift operations required on the second word to maximize the length of the longest common prefix of both the words.Test Case:5ccaddbddccOutput:3
C Language - Write a program that takes in three integers and outputs the largest value. If the input integers are the same, output the integers' value.
Programming Language: Python 5. Write a Python function that takes a positive integer n as an argument and returns 1 if n is prime, and 0 otherwise
Java function to Find whether a given number is a power of 4 or not Example : powerOfFourOrNot(2) -> false powerOfFourOrNot(16) -> true
Programming Language: Python 4. Write a Python function that will take a positive integer n from the user as an argument and returns the largest power of two greater than or equal to n.
Programming Language: Python 5. Write a Python function that will take a positive integer n from the user as an argument and returns 1 if n is prime, and 0 otherwise
Loops module Java Question 3- Write a Java program to take input an postive integer n from user and print the sum of integers from 1 to n in the output.