Question

please solve this question easiest way I saw the other answers but those are not solve my program

Twin primes are two consequetive odd numbers that are prime. Write a function that returns 1 if the input is a prime and O otherwise. int is_prime(int number) { Write a C Program to generate all twin primes in a given range of numbers using the is_prime function. Your program will input following from the command line: min : start of range, an integer max: end of range, an integer These numbers define the range of numbers [min,max] inclusively.

Answer 1

 #include <iostream> using namespace std; int is_prime(int n){ int flag=0; if(n<2){ //number less than 2 is not a prime number return 0; } if(n==2){ //2 is the smallest prime number return 1; } for(int i=2;i<(n/2);i++){ if(n%i==0){ flag=1; } } if(flag==0){ return 1; } else{ return 0; } } void is_twinprime(int min,int max){ cout<<"\ntwin primes are: "; for(int i=min;i<=max;i++){ int r1=is_prime(i); if(r1==1 && i%2==1){ //if no. is prime also check no. is odd or not int r2=is_prime(i+2); //check next odd no. is prime or not if(r2==1 && (i+2)%2==1){ //if this no. is also prime then shows that they are twin primes cout<<"\n"<<i<<" "<<i+2; } } } } int main() { int n,r,min,max; cout<<"Enter the Number to check prime or not: "; cin>>n; r=is_prime(n); //this fuction used to check no. is prime or not cout<<"returned value is: "<<r; cout<<"\nEnter the start of range: "; cin>>min; cout<<"\nEnter the end of range: "; cin>>max; is_twinprime(min,max); //this fuction use to find twin primes between the range return 0; }

Input 2 2 19 Output Enter the start of range: Enter the end of range: twin primes are: 3 5 5 7 11 13 17 19

Above solution is 100% working. please provide feedback.