Question

Write program to display the composite number from 500 to700 which are not prime number

Answer 1

composite number is a positive integer that is not prime. In other words, it has a positive divisor other than one or itself. First few composite numbers are 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, ………

Every integer greater than one is either a prime number or a composite number.

The number one is a unit – it is neither prime nor composite.

How to check if a given number is a composite number or not?

Examples:

Input : n = 21

Output: Yes

The number is a composite number!

Input : n = 11

Output : No

Answer 2

Answer:#include <bits/stdc++.h>  

using namespace std;  

   

bool isComposite(int n)  

{  

   // Corner cases  

   if (n <= 1)  return false;  

   if (n <= 3)  return false;  

   

   // This is checked so that we can skip  

   // middle five numbers in below loop  

   if (n%2 == 0 || n%3 == 0) return true;  

   

   for (int i=5; i*i<=n; i=i+6)  

       if (n%i == 0 || n%(i+2) == 0)  

          return true;  

   

   return false;  

}  

   

   

// Driver Program to test above function  

int main()  

{  

   isComposite(11)?  cout << " true\n": cout << " false\n";  

   isComposite(15)?  cout << " true\n": cout << " false\n";  

   return 0;  

}

Explanation:

and see your answer