Prime number using function

Program:

 #include<stdio.h>
int isprime(int num);
int main()
{
int n;
printf("Enter Number: ");
scanf("%d",&n);
if(isprime(n)==1)
{
printf("%d is prime",n);
}
else
{
    printf("%d is not prime",n);
}
    return 0;
}
int isprime(int num)
{
    int i;
for(i=2;i<num;i++)
{
if((num%i)==0)
{
return 0;
}
}
return 1;
}

Output:

Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

x^y using recursion

Program: #include<stdio.h> int power(int a,int b); int main() { int x,y,ans; printf("Enter x and y:\n "); scanf(...

  • 1² + 2² +3² +.............+ n²
    // 1² + 2² +3² +.............+ n² Program: #include<stdio.h> int main() { int n,i,sum=0; printf("Enter n: "); sc...
  • Convert into upper string
    Program: #include<stdio.h> int main() { char s1[30],s2[30]; int i=0; printf("Enter a string: "); scanf("%s...
  • Number Pattern : 29
    Program: #include <stdio.h> int main() {     int i,j,n; printf("How many lines: "); scanf("%d",&n); ...