prime numbers in c
#include<stdio.h>
main() {
int n, i, count=0;
printf("Enter Number");
scanf("%d",&n);
for ( i = 1; i<= n; i++) {
if (n % i == 1) {
count++;
}
}
if( count == 2) {
printf("Prime Number");
}
else {
printf("Not A Prime Number");
}
}prime or composite in c using function
#include<stdio.h>
int prime_composite(int num);
void main()
{
int n,ret;
printf ("Enter a number: ");
scanf ("%d",&n);
ret = prime_composite(n);
if(ret == 2 )
printf("nThe number is Primen");
else
printf("nThe number is Compositen");
}
int prime_composite(int num)
{
int i, c=0;
for (i=1;i<=num;i++)
{
if(num%i==0)
c=c+1;
}
return c;
}prime number c program
int isPrime(int n) {
for (int i = 2; i < n; i++) if (n % i == 0) return 0;
return 1;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
