How to Find Prime Numbers Using Python

Prime numbers hold a key position in programming and mathematics. In this article, we will explore how to verify if a number is prime using a straightforward Python script.

First, let's define what a prime number is. A prime number is an integer with precisely two factors: 1 and the number itself. For instance, the numbers 2, 3, 5, 7, 11, 13, 17, and 19 are prime. Conversely, 4 is not prime since it can be divided by 1, 2, and 4.

Now, let's dive into the Python program designed to identify prime numbers. The function `prime(n)` is defined to ascertain whether a number `n` is prime. This function iterates through all numbers from 2 up to `n - 1` and checks if `n` is divisible by any of them. If a divisor is discovered, the function promptly returns `False`. Otherwise, after completing the loop without finding any divisors, the function returns `True`, signaling that `n` is indeed prime.

To demonstrate the program's functionality, we iterate over the numbers from 10 to 20. For each number, we invoke the `prime(n)` function. If the function returns `True`, the number is printed. As a result, the output displays the prime numbers within this range: 11, 13, 17, and 19.

This exercise serves as an excellent introduction to programming concepts such as functions, loops, conditional statements (if), the modulus operator (`%`), and return statements. Mastering these fundamentals through this task provides a solid foundation for further explorations in programming.