Question

A prime number is a number that can be evenly divided by only itself and 1. For example, the number 5 is prime because it can be evenly divided by only 1 and 5. The number 6, however isn't prime because it can be evenly divided by 1,2,3, and 6. Write a bool function named isprime that takes an integer as an argument and returns true if the argument is a prime number or false otherwise. Use the function in a program that lets the user enter a number and then displays a message indicating whether the number is prime or not. Submit your C++ program code along with screenshots. 

Answer 1

Code Screenshot:





Executable Code:

#include using namespace std; bool isPrime(int); int main() int number; bool prime; cout<<" Enter a number "; cin>number; if(isPrime (number)) cout<Enter a number 7 7 is prime Enter a number 49 49 is not prime

#include
using namespace std;
bool isPrime(int);
int main()
{

int number;
bool prime;
cout<<"Enter a number ";
cin>>number;
if(isPrime(number))
cout< else
cout< return 0;

}

bool isPrime(int n)
{
  
int i;
for(i=2;i if(n%i==0) //if you find a factor the number isn't prime
return false;
return true; // get here only if no factors
}



Sample Output:


Enter a number 7 7 is prime



Enter a number 49 49 is not prime





Please comment below for any modifications or queries..
Do rate the answer thanks..

Add a comment