The Program in C++ to Check whether a number is prime or not is given below:
#include <iostream>
using namespace std;
int main()
{
/* variable definition and initialization */
int n, i, c = 0;
/* Get user input */
cout << "Hello Codeauri Family, enter any number here:\n ";
cin>>n;
/*logic*/
for (i = 1; i <= n; i++)
{
if (n % i == 0)
{
c++;
}
}
if (c == 2)
{
cout << "Yes, this a Prime number" << endl;
}
else
{
cout << "Sorry,this is not a Prime number" << endl;
}
return 0;
}Output:
Hello Codeauri Family, enter any number here:
7
Yes, this a Prime number
Pro-Tips💡
The program then uses a for loop to iterate from 1 to the value of n. In each iteration,
the program checks if n is divisible by the current value of i by using the modulus operator (%). If it is, it increments the value of c by 1.
After the for loop, the program checks if the value of c is equal to 2.
If it is, it means that n only has two factors (1 and itself) and is therefore a prime number. The program then prints “Yes, this is a Prime number” using the cout statement.
If c is not equal to 2, the program prints “Sorry, this is not a Prime number” using the cout statement.
Learn C-Sharp ↗
C-sharp covers every topic to learn about C-Sharp thoroughly.
Learn C Programming ↗
C-Programming covers every topic to learn about C-Sharp thoroughly.
Learn C++ Programming↗
C++ covers every topic to learn about C-Sharp thoroughly.