Python Practice Questions Tutorial

Check if a Number is Prime in Python

❮ Previous Next ❯

A Python program to determine whether a given number is prime using an efficient approach.

Here’s the explanation in points:

Prime Number Definition: A prime number is greater than 1 and has no divisors other than 1 and itself.
Function Definition: The function is_prime_number_checker(number) is used to check if a number is prime.
Check for Numbers Less Than 2: If the number is less than 2, the function returns False because numbers less than 2 are not prime.
Iterating Through Possible Divisors: The function checks for divisibility from 2 to the square root of the number (since divisors larger than the square root would have already been found by smaller divisors).
Check Divisibility: If the number is divisible by any value in the range, the function returns False, meaning the number is not prime.
Return True for Prime: If no divisors are found, the function returns True, indicating the number is prime.
User Input and Output: The program takes an input number from the user, checks if it is prime, and prints the result.
Example: If the input is 7, the program will print that 7 is a prime number.

Program:

def is_prime_number_checker(number):

    if number<2:

        return False

    for i in range(2,int(number**0.5)+1):

        if number%i==0:

            return False  

    return True

num=int(input("enter a number : "))

if is_prime_number_checker(num):

    print(f"{num} is prime number")

else:

    print(f"{num} is not prime number")

❮ Previous Next ❯

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Python Coding Questions on Numbers

Python Coding Questions on String

Python Coding Questions On List

Check if a Number is Prime in Python

Important Links