Skip to main content

PRIME NUMBERS

Prime numbers

#include < stdio.h >

int check_prime(int);

main()
{
  int i, n, result;

  printf("Enter the number of prime numbers required\n");
  scanf("%d",&n);
  printf("First %d prime numbers are :\n", n);

  for(i=0; i < n; i++){
  result = check_prime(i);
  /*if i is prime then it will return 1*/

  if ( result == 1 )
    printf("%d \n", i);
  }
  return 0;
}

int check_prime(int a)
{
  int c;
  /*starting from 2, if no is completely divisible by any no then it is not prime*/
  for ( c = 2 ; c <= a - 1 ; c++ )
  {
  if ( a%c == 0 )
    return 0;
  }
  if ( c == a )
    return 1;
}

Labels:

Comments

Post a Comment

Popular posts from this blog

CALCULATE PERCENTAGE

Calculate percentage #include < stdio.h > void main() { int s1, s2, s3, s4, s5, sum, total = 500; float per; printf("\nEnter marks of 5 subjects : "); scanf("%d %d %d %d %d", &s1, &s2, &s3, &s4, &s5); sum = s1 + s2 + s3 + s4 + s5; printf("\nSum : %d", sum); per = (sum * 100)/500; /* percentage formula*/ printf("\nPercentage : %f", per); }
Post a Comment
Read more

SIMPLE INTEREST

Simple interest #include < stdio.h > void main() { int amount, rate, time, ans; printf("\nEnter Principal Amount : "); scanf("%d", &amount); printf("\nEnter Rate of Interest : "); scanf("%d", &rate); printf("\nEnter Period of Time : "); scanf("%d", &time); ans = (amount * rate * time)/100; /*Simple interest formula*/ printf("\nSimple Interest : %d",ans); }
Post a Comment
Read more

HCF AND LCM

HCF and LCM #include < stdio.h > long gcd(long, long); int main() {   long x, y, hcf, lcm;   printf("Enter two integers\n");   scanf("%ld%ld", &x, &y);   hcf = gcd(x, y);   lcm = (x*y)/hcf;   printf("Greatest common divisor of %ld and %ld = %ld\n", x, y, hcf);   printf("Least common multiple of %ld and %ld = %ld\n", x, y, lcm);   return 0; } /*if 1st no is 0 then 2nd no is gcd make 2nd no 0 by subtracting smallest from largest and return 1st no as gcd*/ long gcd(long x, long y) {   if (x == 0) {   return y;   }   while (y != 0) {   if (x > y) {     x = x - y;   }   else {     y = y - x;   } } return x; }
Post a Comment
Read more