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

Post a Comment

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 ;     }      ...
1 comment
Read more

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 )     {       ...
Post a Comment
Read more

Happy Number Solution | Recursion

  /**  * Write a Java program to find and print the Happy numbers between m and n. Happy number: Starting with any positive integer, replace the number by the sum of the squares of its digits,  and repeat the process until the number equals 1, or it loops endlessly in a cycle which does not include 1. Example: 19 is a happy number 1^2 + 9^2=82 8^2 + 2^2=68 6^2 + 8^2=100 1^2 + 0^2 + 02=1 The first few happy numbers are 1, 7, 10, 13, 19, 23, 28, 31, 32, 44, 49, 68, 70, 79, 82, 86, 91, 94, 97, 100, ...  */ import java.util.*; public class HappyNum {     public static int digitSq( int x) // recursive function to find square of digits of the number     {         if(x<10)         return x*x;         else         return (x%10)*(x%10) + digitSq(x/10);     } // end of digitSq()          public static boolean isHappy(int num, int i) ...
Post a Comment
Read more