Question

You are to create a program that queries the user for a range of integer values (min and max). For this range, you are to find all of the prime numbers and print them to the screen. The user is then given the option to request that all of the non-prime numbers be printed to the screen with at least one factor pair that proves that they are not prime. (Using language C)

Answer 1

#include<stdio.h>

#include<conio.h>

int main()

{

int i,n;

int max,min;

printf(“enter the min_values”);

scanf(“%d”,&min);

printf(“enter the max_values”);

scanf(“%d”,&max_values);

for(n=min+1;n<max;n++)

{

int prime;

count=0;

for(int i=2;i<n/2;i++)

{

if(n%i==0)

{

count++;

break;

}

if(count==0&&n!=1)

{

printf(“prime numbers are”);

}

else

{

printf(“nonprime numbers are”);

}

return 0;

}