Question

Use C programming

Make sure everything works well only upload

Write a program that takes an integer from standard input and prints all prime numbers that are smaller than it to standard output. Recall that a prime number is a natural number greater than 1 whose only positive divisors are 1 and itself. At the start of the program, prompt the user to input a number by printing "Input a number greater than 2:\n". If the user's input is less than or equal to 2, then print "No prime number is smaller than <user's input> .\n", where <user's input> is replaced by the number input by the user. If the user inputs a number greater than 2, then print "Prime numbers smaller than <user's input>: ". Then on the same line, print out a list of all prime numbers that are smaller than the input. In your list, each prime number must be separated by one space and a newline must be printed immediately after the last number in the list. As part of your program, you must a function that takes an integer as an argument, returns 1 if the integer is prime, and returns 0 otherwise. You can use the following function prototype: int isPrime(int number); Example input/output pairs (excluding the prompt) are provided below: (a) Input: 6; Output: Prime numbers smaller than 6: 2 3 5 (b) Input: 23; Output: Prime numbers smaller than 23: 2 3 5 7 11 13 17 19 (c) Input: 1; Output: No Prime numbers is smaller than 1.

Answer 1

program:

#include <stdio.h> #include <stdlib.h> int isPrime(int num); //function to check if given number is prime or not // Begining of C program int main() // Declare and intialize the variables int i,n-0, num; // Prompt the user to input a number printf("Enter a number greater than 2:") // Read the number from the user scanf("%d", &num); // Use if statement to chech the given number is greatherthan or not if (numc-2) printf("No return e prime number is smaller than %d",num);

printf("prime numbers smaller than %d is : ", num ); // Use for loop to check the prime numbers which are smaller //than given number for(i-2; i< num; i+) n- isPrime (i); // if isPrime returns 1 then i is a prime number which is //less than given number // If statement used to print the prime numbers if (n--1) printf(" %d " , i);

return 0; //funtion to check if given number is prime or not int isPrime(int num) int i, flag-e; for(i-2; inum; i++) if(num % i -0) flag 1; break; if (flag-0) return 1;

else return 0;

Sample Output:

Enter a number greater than 2:23 prime numbers smaller than 23 is2 3 57 11 13 17 19:

Enter a number greater than 2:10 rime numbers smaller than 10 is 2357

Enter a number greater than 2:1 No prime number is smaller than 1:

Code to copy:

#include <stdio.h>
#include <stdlib.h>
int isPrime(int num);
//function to check if given number is prime or not

// Begining of C program
int main()
{
// Declare and intialize the variables
int i,n=0, num;
  
// Prompt the user to input a number
printf("Enter a number greater than 2:");
  
// Read the number from the user
scanf("%d", &num);
  
// Use if statement to chech the given number is greatherthan or not
if(num<=2)
{
printf("No prime number is smaller than %d",num);
return 0;
}
  
printf("prime numbers smaller than %d is :",num );
  
// Use for loop to check the prime numbers which are smaller
//than given number
for(i=2; i< num; i++)
{
n= isPrime(i);
// if isPrime returns 1 then i is a prime number which is
//less than given number
  
// If statement used to print the prime numbers
if(n==1)
{
printf(" %d",i);
}
}

return 0;
}

//funtion to check if given number is prime or not.

int isPrime(int num)
{
int i, flag=0;
for(i=2; i<num; i++)
{
if(num % i == 0)
{
flag =1;
break;
}
}
  
if(flag==0)
{
return 1;
}
else
{
return 0;
}
}