How do you print composite numbers in python?

October 18, 2016 June 17, 2020

Hello people, welcome back! Here we discuss a python program that finds whether a given number is a prime number or composite number or neither of them.

Definition: A number which is greater than 1 is said to prime if it has no other factors other than 1 and itself. The numbers 0 and 1 are neither prime nor composite. And remaining all numbers are composite numbers.

Master the basics of data analysis in Python. Expand your skillset by learning scientific computing with numpy.

Take the course on Introduction to Python on DataCamp here //bit.ly/datacamp-intro-to-python

Prime or Composite – Code Visualization

Task :

To find whether a number is a prime or composite number.

Approach :

• Read input number using input[]orraw_input[].
• Check if num is greater than 1.
• Find factors
  • Run a for loop ranging from 2 to the num entered.
  • check if num divided by any number gives a remainder 0.
  • if it gives a remainder of 0, the number is not a prime number.
  • if not, the number is a prime number.
• If the number entered is either 0 or 1, we say that the number is neither prime nor composite number.
• All other numbers are composite numbers.
• Print the result.

Program :

num = int[input["Enter any number : "]]
if num > 1:
    for i in range[2, num]:
        if [num % i] == 0:
            print[num, "is NOT a prime number"]
            break
    else:
        print[num, "is a PRIME number"]
elif num == 0 or 1:
    print[num, "is a neither prime NOR composite number"]
else:
    print[num, "is NOT a prime number it is a COMPOSITE number"]

Output :

View Discussion

Improve Article

Save Article

View Discussion

Improve Article

Save Article

A 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

The idea is simple, we can use any of the below methods used for prime checking. We just need to change return statements. Return true is changed to return false and vice versa. 
 

• Primality Test | Set 1 [Introduction and School Method]
• Primality Test | Set 2 [Fermat Method]
• Primality Test | Set 3 [Miller–Rabin]

In below code optimized school method is discussed. 
 

C++

#include

using namespace std;

bool isComposite[int n]

{

    if [n

Javascript

function isComposite[n]

{

    if [n =1:.