3/03/2015

C++ Program To Find Number Is Prime Or Not

Problem :- Write A Program To Find Number Is Prime Or Not

Prime Number :- A Number That Can Only Divisible By Itself or 1.
You can see that it's clear a number divisible by itself or one then use a loop start from one like condition=1 and max condition up to <=Number 
and divide a number by condition and increase counter by ++ if number divide after the end if count is equal to 2 then number is prime otherwise not.

Solution :-

#include<iostream>
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<<"\n"<<number<<"IS PRIME NUMBER \n";
    }
    else
    {
        cout<<"\n"<<number<<"IS NOT A PRIME NUMBER \n";
    }
    return 0;

}

Output:-

C++ Program To Find Number Is Prime Or Not

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me

0 Comments: