How To Find Prime Numbers In Python

Prime numbers are numbers that are divisible only by 1 and themselves. For example, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 are prime numbers.

Prime numbers have many applications in computer science and mathematics, and Python provides us with an efficient way to find prime numbers. In this tutorial, we will explore the various ways we can find prime numbers in Python.


Step 1: Using a for-loop to check if a number is prime

The easiest way to determine if a number is prime is to check if it is divisible by any number less than itself. We can use a for-loop to achieve this in Python.

We will start our loop at 2 (since 1 is not considered a prime number), and continue until we reach the number we want to check.

To use this function, we simply call it and pass in the number we want to check. The function will return True if the number is prime, and False otherwise.

Step 2: Using the math library

Python also provides us with math.sqrt () function, which returns the integer square root of a number. We can use this function to improve the efficiency of our prime checking function by reducing the range of the for-loop.

In this function, we first check if the number is 2 (the only even prime number), or if it is even or 1 (which are not prime).

We then use the math.isqrt() function to find the square root of the number and round up to the nearest integer. We then start our loop at 3 and increment by 2 (to skip even numbers) until we reach the square root of the number.

The rest of the function is the same as before – if we find a number that divides without remainder, we return False. Otherwise, we return True.


In this tutorial, we learned how to find prime numbers in Python using a for-loop and the math library. By using these methods, we were able to efficiently determine whether a number is prime or not.