// Program to find a given number is Prime (or) not.
#include<iostream>
using namespace std;
int main()
{
int n,i,is_prime=1;
cout<<"\n enter a number"<<endl;
cin>>n;
for(i=2;i<n;i++)
{
if(n%i==0)
is_prime=0;
}
if(is_prime)
cout<<n<<" is a prime"<<endl;
else
cout<<n<<" not a prime "<<endl;
return 0;
}
02 August 2018
C/C++ Program to find a given number is Prime (or) not.
Subscribe to:
Post Comments (Atom)
To convert from Upper case to lowercase(A to a)
//converting from Upper to lower(A to a) import java.util.*; class case { public static void main(String args[]) { System.out.pr...
-
Perfect number : is a positive integers which is equal to the sum of its proper positive divisors, that is, the sum of its positive...
-
//Program to calculate area of circle using SWITCH statement import java.util.*; class switch1 { public static void main(String a...
-
//C++ program to calculate x^n using recursion #include<iostream> using namespace std; int xn(int,int); int main() { ...
No comments:
Post a Comment