Two positive integers are called amicable if the sum of divisors of the first is equal to the sum of the divisor of the second. Write a program to test if 2 integer numbers are amicable. For example, 220 and 284 are amicable since the sum of divisors is 504 for both integers as shown below: sum of divisors of 220 = 1 + 2 + 4 + 5+ 10 + 11 + 20 + 22 + 44 + 55 + 110 + 220 = 504. sum of divisors of 284 = 1 + 2 +4 + 71 + 142 + 284 = 504. Sample Run 1: Enter two integers: 220 284 220 and 284 are amicable Sample Run 2: Enter two integers: 220 110 220 and 110 are not amicable

Two positive integers are called amicable if the sum of divisors of the first is equal to the sum of the divisor of the second. Write a program to test if 2 integer numbers are amicable. For example, 220 and 284 are amicable since the sum of divisors is 504 for both integers as shown below: sum of divisors of 220 = 1 + 2 + 4 + 5+ 10 + 11 + 20 + 22 + 44 + 55 + 110 + 220 = 504. sum of divisors of 284 = 1 + 2 +4 + 71 + 142 + 284 = 504. Sample Run 1: Enter two integers: 220 284 220 and 284 are amicable Sample Run 2: Enter two integers: 220 110 220 and 110 are not amicable

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Two positive integers are called amicable if the sum of divisors of the first is equal to thesum of the divisor of the second. Write a program to test if 2 integer numbers are amicable.For example, 220 and 284 are amicable since the sum of divisors is 504 for both integers asshown below:sum of divisors of 220 = 1 + 2 + 4 + 5 + 10 + 11 + 20 + 22 + 44 + 55 + 110 + 220 = 504.sum of divisors of 284 = 1 + 2 + 4 + 71 + 142 + 284 = 504.
Two positive integers are called amicable if the sum of divisors of the first is equal to the sum of the divisor of the second. Write a program to test if 2 integer numbers are amicable. For example, 220 and 284 are amicable since the sum of divisors is 504 for both integers as shown below: sum of divisors of 220 = 1 + 2 + 4 + 5 + 10 + 11 + 20 + 22 + 44 + 55 + 110 + 220 = 504. sum of divisors of 284 = 1 + 2 + 4 + 71 + 142 + 284 = 504. Sample Run 1: Enter two integers: 220 284 220 and 284 are amicable Sample Run 2: Enter two integers: 220 110 220 and 110 are not amicable
Write a program that works out if a given year is a leap year This is how to workout whether if a perticular year is a leap year on every year that is evenly divisible by 100 except every year that is evenly divisible by 100 unless the year is also evenly divisible by 400 Note Study the flow chart given below START No Yesit cleanly divisible by Not Leap No Yes it cleanly divisible by 1007 Leap No Yes it cleanly divisible by 4007 Not Leap Leap Guideline : Create a unique code Create a function leapYear_697 to accept the parameter (i.e year ) and return whether the given year is a leap year Javascript program name should be like Assign2 697
Write a program that computes the amount of calories burned when you run. Your program should ask for the duration of the run in minutes the speed of the run in mph and your weight in pounds. Compute the amount of calories burned and print it. The calories burned is computed using the expression below: \n", "\n", "$$ calories/minute = (MET*weight*1.6)/200 $$\n", "\n", "MET is a value given below:\n", " - if speed is 5mph or less - MET = 8\n", "- if speed is greater than 5 and less or equal 8 mph - MET = 11.5 \n", "- if speed is greater than 8 and less or equal 10 mph - MET = 14 \n", "- if speed is greater than 10 mph - MET = 20\n", "\n", "Remeber to multiply this result by the time running to show the total amount of calories burned.\n"
A right triangle can have sides that are all integers. The set of three integer values for the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the hypotenuse. Write a program to find all Pythagorean triples for side1, side2, and the hypotenuse all no larger than 30. Use a triple-nested for loop that simply tries all possibilities. Using Files in c programming language and comment all your steps please
Suppose that the first number of a sequence is x, where x is an integer. Define a0= x; an+1=an/2 if an is even; an+1= 3*an +1 if an is odd. Then there exists an integer K such that ak=1. Write a Program that prompts the user to input the value of x. The program outputs the integer K such that ak=1 and the numbers a0, a1, a2,……….., ak.. (For example, if x=75, then K=14, and the numbers a0, a1, a2,……….., a14, respectively, are 75,226,113,340,170,85,256,128,64,32,16,8,4,2,1. ) Enhance your program from part a by outputting the position of the largest number and the largest number of the sequence a0, a1, a2,……….., ak.. (For example, the largest number of the sequence 75,226,113,340,170,85,256,128,64,32,16,8,4,2,1 is 340 and its position is 4. )
Write a program that translates a letter grade into a number grade. Letter grades are A, B, C, D, and E, possibly followed by + or -. Their numeric values are 4, 3, 2, 1, and 0. There is no F+ or F-. A + increases the numeric value by O.3, a – decreases it by 0.3. However, an A+ has value 4.0. Enter a letter grade: B- The numeric value is 2.7.
Using Paython Write a program that asks a student for his grade (out of 100) in 3 exams and then print out his final grade (out of 100), given that the weight of the first exam is 30%, the second 30%, and the third 40%.Example Input:Exam1: 70Exam2: 80Exam3: 90Example Output:Total Grade = 81Explanation: 0.3 * 70 + 0.3 * 80 + 0.4 * 90 = 81
Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! Thank you!
Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! make sure k is identified in the output and don't use arrays for the program. thank you very much!!
Write a program that inputs a number and checks whether it is a perfect number or not. A perfect number is the number that is numerically equal to the sum of its divisors. For example, 6 is a perfect number because the divisors of 6 are 1, 2, 3 and 1+2+3=6
Write a program that accepts a number imput and checks if the difference between the sum of digits at prune positions and the sum of digits at non prime positions is a Fibonaces mmber The Fibonacci minber is any number from the Fibonacci series (0), 1, 1.2, 3, 5, K. 11. The position of digits in the number should be considered from left to right. For example, in the number 671, digit 6 is at position 1, digit 7 s at position 2, digit is ut position 3 You are allowed to use suitable user-defined functions write it in simple c program (plz send me in less than an hour)