Question: ) A prime number is a positive integer divisible only by itself and 1. A number which is not prime is composite. For example, 2,

) A prime number is a positive integer divisible only by itself and 1. A number which is not prime is composite. For example, 2, 3, and 5 are prime, but 4 and 6 are composite. A perfect number, p, is a positive integer that equals the sum of its divisors, excluding p itself. For example, 6 is a perfect number because the divisors of 6 (1, 2, and 3) add up to 6. Write a program which looks for primes and perfect numbers as follows. Prompt the user to enter the minimum value to check, and ensure that the user enters an integer greater than 1. Next, prompt the user to enter the maximum value to check, and ensure that the user enters an integer greater than the minimum value he/she just entered. For each integer x between the minimum and maximum values to check (inclusive), print a list of all the divisors of x starting from 1 up to x-1. Then print whether x is prime or composite. Next, print whether x is perfect or not perfect. Finally, print a count of the number of primes found and a count of the number of perfect numbers found. Here is the output from an example run of the program: Let's search for prime numbers and perfect numbers! Enter minimum value to check (an integer greater than 1): 0 That entry was not valid. Please be sure to enter an integer greater than 1. Enter minimum value to check (an integer greater than 1): 1 That entry was not valid. Please be sure to enter an integer greater than 1. Enter minimum value to check (an integer greater than 1): 2 Enter maximum value to check (an integer greater than the minimum value to check): 1 That entry was not valid. Please be sure to enter an integer greater than the minimum value to check. Enter maximum value to check (an integer greater than the minimum value to check): 2 That entry was not valid. Please be sure to enter an integer greater than the minimum value to check. Enter maximum value to check (an integer greater than the minimum value to check): 6 2 is divisible by: 1 2 is prime. 2 is not perfect. 3 is divisible by: 1 3 is prime. 3 is not perfect. 4 is divisible by: 1 2 4 is composite. 4 is not perfect. 5 is divisible by: 1 5 is prime. 5 is not perfect. 6 is divisible by: 1 2 3 6 is composite. 6 is perfect. Primes found: 3 Perfect numbers found: 1 [JAVA]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

The set of natural numbers is an infinite collection of positive integers that begins with one and continues endlessly in the positive direction. This implies that the set comprises the numbers 1, 2,...

Design and write a modular python program for chapter 7 programming exercise # 1 2 from your textbook, with the following modifications: prompt for input of a positive number and call a function to...

I need some code help on this assignment its about a Sieve of Eratosthenes in the coding language java, you have to do it using the starting code which I've posted in the Question. Please follow the...

You have been hired to generate a list of prime numbers up to some user-specified bound. To do this, we are going to implement of the watershed algorithms of ancient Greek mathematics. This technique...

Background You have been hired to generate a list of prime numbers up to some user-specified bound. To do this, we are going to implement of the watershed algorithms of ancient Greek mathematics....

Ant help would be appreciated, I'm kind of confused. Objectives Working with collections Working with iterator Background You have been hired to generate a list of prime numbers up to some...

Please help with 1 and 2 1. Consider the inequality 3" N. 2. Using strong induction, show that any integer n greater than 1 can be written as a product of primes, where a prime number is a positive...

NEEDED IN C++. As you recall, a prime number is a positive integer that is evenly divisible only by 1 and itself. A semi-prime is a number that is the product of two prime numbers and is evenly...

Beginner Java Programming (boolean, do/while loops, for loops, if/else loops) A prime number is a positive integer greater than 1 that is divisible only by itself and 1. In this assignment, you are...

Data Structures and Algorithms question. A prime number is a positive integer other than 1 and is divisible only by 1 and itself. For example, 7 is a prime number because the only positive factors of...

For the reaction 2Cu(s) + S(s) Cu2S(s) Ho and Go are negative and So is positive. a. At equilibrium, will reactants or products predominate? Why? b. Why must the reaction system be heated in order...

Draw a one-way sensitivity analysis graph for operation costs for Eagle Airlines. note that the equation for total revenue is: Total Revenue = Revenue from Charters + Revenue from Scheduled flights =...

Question 6 Components such as formatting dictated by legal regulations, minimal records needed to start an audit, and customary to qualify statements if conditions dictate are parts of audit database...

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

Incorporate government into the table by assuming that it plans to tax and spend $20 billion at each possible level of GDP. Also assume that the tax is a personal tax and that government spending...

Fill in columns 5 and 6 and determine the equilibrium GDP for the open economy. Explain why this equilibrium GDP differs from that of the closed economy. c. Given the original $20 billion level of...

Why is the long-run aggregate supply curve vertical? Explain the shape of the short-run aggregate supply curve. Why is the short-run curve relatively flat to the left of the full-employment output...