Question

Assignment

1. Develop a program to analyze one or more numbers entered by a user. The user may enter one or more numbers for analysis. Input should be limited to numbers from 1 through 1000.
2. Determine if a number is a prime number or not. A prime number is one whose only exact divisors are 1 and the number itself (such as 2, 3, 5, 7, etc.).
3. For non-prime numbers, output a list of all divisors of the number. Format your output so there are between 5 and 10 numbers per line to conserve paper. DO NOT output one number per line.
4. Include whether a number is a perfect number. A perfect number is when all divisors add up to the number itself. Example: 6 is a perfect number. 1 + 2 + 3 = 6

Check your solution with at least 6 numbers: at least 3 prime numbers and at least 3 numbers that are not prime. Check your solution with at least two sets of invalid data.

Use good program design, efficient code, and document your code with explanatory comments throughout. Be sure to include adequate error handling in your program and error data when you run the program to demonstrate error handling.

Input

One or more numbers entered by user, entered one at a time. Program must loop back to the beginning until the user indicates that they are done.

Sample Output

     Input a number between 1 and 1000:   -5

     That number is not valid. Input another number.    

     Input a number:   17

     That is a prime number.

     Enter a new number: 28

    That is not a prime number. Divisors are:

     1     2    4     7     14

     HOW DOES THIS PROGRAM END?

Note

Adequately check entered data for validity. Use adequate test data to process all valid data and representative data to show how your program handles invalid data.

Label all output clearly. Be sure your output file contains user prompts and what was entered by the user in addition to the results of your program processing.

Here is my incomplete program and I'm stuck! Please help me complete it!

#include
using namespace std;

int main()
{
   int num, i, total;
   bool isPrime = true;
  

   cout << "Enter a number from 1 to 1000: " << endl;
   cin >> num;
   while (cin.fail()) {
           cin.clear();
           cin.ignore(200, '\n');
           cout << "Invalid input. Try again." << endl;
           cin >> num;
       }
  
   for (total = 0; num < 1 || num > 1000; cin >> num)
   {cout << "Invalid input: The number must be between 1 and 1000. Try again." << endl;}
  
   for (i = 2; i <= num / 2; ++i)
   {
       if (num % i == 0)
       {
           isPrime = false;
           break;
       }
   }
   if (isPrime)
       cout << "This is a prime number" << endl;
   else
   {
       cout << "This is not a prime number. The divisors of "<< num << " are" << endl;
       for (i = 1; i <= num; ++i)
           if (num % i == 0)
               cout << i << " ";
   }
     

   system("pause");
   return 0;

Answer 1

Here Iam providing the code and the output for the given problem.

Code:-

Code in text format:-

#include <iostream>
using namespace std;
int checkPrime(int number);
int main()
{
int number ,i , prime = 0 , result , sum = 0,newline =0,rem; //declairng variables
std::cout << "Input a number betwenn 1 and 1000" << std::endl;
std::cin >> number;
while(number < 0 || number > 1000){ //asking user to enter valid number loop terminates if valid
std::cout << "The number is invalid.Input another number:" << std::endl;
std::cin >> number;
}
  
result = checkPrime(number); //calling checkPrime fucntion
  
while(result != 1){ //if the number is a prime number we ask again to enter
std::cout << "That is a prime number" << std::endl;
std::cout << "Enter another number" << std::endl;
std::cin >> number ;
result = checkPrime(number);
}
  
std::cout << "This is not a prime number.Divisors are :" << std::endl; //printing the Divisors
for (int i=1;i<number;i++){
if (number%i==0){
cout << i <<" ";
newline = newline+1;
if(newline%5 == 0) //if printing length more than 5 we print newline
cout << "\n";
  
}
  
}
  
for(i = 1 ; i <=(number -1); i++){ //checking the number is a perfect number or not
rem = number%i;
if (rem==0)
{
sum= sum+i;
}
}
if (sum == number)
std::cout <<"\nThe entered number is a perfect number" << std::endl;
  
  
}

int checkPrime(int number){ //fucntion to check if prime or not
int prime = 0,i;
  
for(i = 2 ; i <= number/2; i++){
if(number%i == 0){
prime = 1;
break;
}
}
return prime;
}

Output:-