Skip to main content

Generate Prime Numbers within a given range | C programming

Q.5  WAP in C/ C++/ java to generate prime numbers between M and N (0> M,N <1000)


Solution : 

#include <stdio.h>

int isprime(int n)
{
    int f=0;
    for (int j = 1; j <= n; j++)
    {
        if (n % j == 0)
            f++;
    }
    if (f == 2)
    return 1;
    else
    return 0;
}

void main()
{
    int M, N;
    printf("\nEnter the lower limit : ");
    scanf("%d", &M);

    printf("Enter the upper limit : ");
    scanf("%d", &N);

    if (M > N || M == N || M < 1 || M >= 1000 || N < 1 || N >= 1000)
    {
        printf("\nInvalid input. Enter the inputs again -->");
        main();
    }
    else
    {
        printf("The prime numbers are : ");
        for (int i = M; i <= N; i++)
        {
            if(isprime(i))
            printf("%d, ", i);
        }
    }
}

Comments

Popular posts from this blog

Harshad Number | C programming

  Q.10     WAP in C/ C++/ java to check whether a number is a  Harshad Number  or not.  In recreational mathematics, a Harshad number in a given number base is an integer that is divisible by the sum of its digits when written in that base.         Example: Number 200 is a Harshad Number because the sum of digits 2 and 0 and 0 is 2(2+0+0) and 200 is divisible by 2. Number 171 is a Harshad Number because the sum of digits 1 and 7 and 1 is 9(1+7+1) and 171 is divisible by 9.     Solution :  #include <stdio.h> int   sumofdigits ( int  x)  // function to compute sum of digits {      int   sum = 0 ;      while (x > 0 )     {          sum += x % 10 ;         x = x / 10 ;     }      ...

Calculating Sum of digits & total number of digits | C programming

  Q.7       WAP in C/ C++/ java to find the sum of the digits of the number and also count   the number of digits present.          Example,                      Input : 123,                       Output : Sum of digits = 6             [ expl. 1+2+3]                                          Total digits = 3 Solutions : #include <stdio.h> int   digits ( int  x)  // function to count total no. of digits {      int   c = 0 ;      while  (x > 0 )     {       ...