What is a PRIME NUMBER?
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int number,count=0;
cout<<"ENTER NUMBER TO CHECK IT IS PRIME OR NOT : ";
cin>>number;
for(int a=1;a<=number;a++)
{
if(number%a==0)
{
count++;
}
}
if(count==2)
{
cout<<" PRIME NUMBER \n";
}
else
{
cout<<" NOT A PRIME NUMBER \n";
}
//getch();
}
//Code Ends
OUTPUT:
" A Natural number greater than 1which has only two divisor 1 and itself is called prime number ".
For Example:
5 is prime, because it has only two divisors 1 and itself.
C++ Program To Find Prime Numbers
//Code Starts
#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int number,count=0;
cout<<"ENTER NUMBER TO CHECK IT IS PRIME OR NOT : ";
cin>>number;
for(int a=1;a<=number;a++)
{
if(number%a==0)
{
count++;
}
}
if(count==2)
{
cout<<" PRIME NUMBER \n";
}
else
{
cout<<" NOT A PRIME NUMBER \n";
}
//getch();
}
//Code Ends
OUTPUT:
0 comments:
Post a Comment