Question

Is Prime Number
In this program, you will be using C++ programming constructs, such as functions.

main.cpp
Write a program that asks the user to enter a positive integer, and outputs a message indicating whether the integer is a prime number. If the user enters a negative integer, output an error message.

isPrime
Create a function called isPrime that contains one integer parameter, and returns a boolean result. If the integer input is a prime number, then this function returns true, and false otherwise.

Input Validation
You can either assume the user will always input an integer value, or you can add input validation for the integer similar to the example shown in the midterm solution.
If the integer input is a negative number, output an error message.
Hints
Be sure and define the function prototype before main() calls it.
0 and 1 are not prime numbers.
2 is the only even number that is a prime number.
For numbers 3 on up, one way to determine whether the number is prime is to loop through all numbers from 2 through number - 1 to see if it is evenly divisible by any other number. Hint: use the modulus operator.
A more efficient way would be to check only the odd numbers from 3 through the square root of number since the square root represents the half way point for multipliers. This enhancement is not required, as long as your program produces the correct results.
Don't forget to add comments to explain what the code is doing and where control of the program is executing.
Choose variable names and function names that describe its purpose.
Sample Output
Please enter a number: 91

91 is not prime.
Please enter a number: 97

97 is prime. It is divisible only by 1 and itself.
Please enter a number: -1

-1 is not a positive integer.
Please enter a number: 0

0 is not prime.
Please enter a number: 1

1 is not prime.
Please enter a number: 2

2 is prime. It is divisible only by 1 and itself.

Answer 1

c++ code for given above statements:

#include <iostream>
using namespace std;
//boolean function to check prime number or not
bool isprime(int number)
{
//checking given number is prime or not
if (number <= 1)
{
return false;
}
// for loop upto given number range to check given number is prime or not
for (int i=2; i<number; i++)
{
//check numebr is divisible by for loop number
if ( number%i == 0)
{
return false;
}
}
return true;
}
int main()
{
int n;
cout<<"enter the positive integer number \n";
cin>>n;
// its check the given number is positive number or negative number
if (n < 0)
{
cout<<n<<" is not a positive integer. \n";
}
else
{
// function call and if its true is prime number else not prime number
isprime(n)? cout<<n<<" is prime. It is divisible only by 1 and itself. \n" : cout<<n<<" is not prime.";
}
return 0;
}

output:

case_1: n = 91

enter the positive integer number                                                                                                                             

91                                                                                                                                                            

91 is not prime.

case_2: n = 97

enter the positive integer number                                                                                                                           

97                                                                                                                                                          

97 is prime. It is divisible only by 1 and itself.

case_3 : n = -1

enter the positive integer number                                                                                                                           

-1                                                                                                                                                          

-1 is not a positive integer.

case_4: n = 0

enter the positive integer number                                                                                                                           

0                                                                                                                                                           

0 is not prime.

case_5: n = 1

enter the positive integer number                                                                                                                           

1                                                                                                                                                           

1 is not prime.

case_6: n= 2

enter the positive integer number                                                                                                                           

2                                                                                                                                                           

2 is prime. It is divisible only by 1 and itself

Note:

• // indicates comment line for code line.