Write a c program to accept the range of all prime numbers from 1 to n by using while loop?

Answer 1

#include<iosys.h>

#include<math.h> // for sqrt()

bool is_prime (unsigned num) {

if (num<2) return false; // 2 is the first prime

if (!(num%2)) return num==2; // 2 is the only even prime

// largest potential factor is square root of num

unsigned max = (unsigned) sqrt ((double) num) + 1;

// test all odd factors

for (unsigned factor=3; factor<max; factor+=2) if (!(num%factor)) return false;

return true; // if we get this far, num has no factors and is therefore prime

}

int main (void) {

// test all nums from 0 to 100 inclusive

for (unsigned num=0; num<=100; ++num) {

if (is_prime (num))

printf ("%d is prime\n", num);

else if (num>0)

printf ("%d is composite\n", num);

else printf ("%d is neither prime nor composite\n", %d);

}

return 0;

}

Answer 2

Yes, please do write.