A positive integer which is only divisible by 1 and itself is known as prime number.
For example: 13 is a prime number because it is only divisible by 1 and 13 but, 15 is not
prime number because it is divisible by 1, 3, 5 and 15.
Example: Check Prime Number
#include
using namespace std;
int main()
{
int n, i;
bool isPrime = true;
cout << "Enter a positive integer: ";
cin >> n;
for(i = 2; i <= n / 2; ++i)
{
if(n % i == 0)
{
isPrime = false;
break;
}
}
if (isPrime)
cout << "This is a prime number";
else
cout << "This is not a prime number";
return 0;
}
Output
Enter a positive integer: 29
This is a prime number.
<< PREVIEW >>
<< NEXT >>
Comments
Post a Comment