Checking whether a number is Prime.

PROCEDURE:-

      1.input an interger value n
      2.start  finding modulo value for  n with i=2 to n-1 value incrementing i by 1 each time
      3.if at  any point remainder becomes 0
      4.print that number is not prime
      5.else print that the number is prime

CODE:-

#include<stdio.h>
void main()
{
int n , i,flag =0;
printf(“enter a number “);
scanf(“%d”,&n);
for(i=2;i<n;i++)
{
if (n % i = = 0)
  {
   flag=1;
   break;
   }
}
if (flag = = 0)
printf(“the given number %d is prime number “,n);
else
printf(“the given number %d is not a prime number “,n);
}


Input:- enter a number  5
Output:-the given number 5 is prime number