Python Program to find all Prime Numbers in given Range
In this tutorial, we will discuss how to find all prime numbers in a given range
Before going to the program first, let us understand what is Prime Numbers.
Prime Numbers:
- A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.
Related: Python Program to find the Factorial of a number using Iteration
Program code for Prime Numbers in a given Range in Python
# Prime Numbers in a Range in Python
def is_prime(num):
if num <= 1:
return False
for i in range(2, int(num ** 0.5) + 1):
if num % i == 0:
return False
return True
def prime_numbers_in_range(start, end):
primes = []
for num in range(start, end + 1):
if is_prime(num):
primes.append(num)
return primes
start = int(input("Enter the start of the range: "))
end = int(input("Enter the end of the range: "))
primes = prime_numbers_in_range(start, end)
print(f"Prime numbers between {start} and {end} are: {primes}")
[/code]
Explanation
- Function Definition: The
is_prime
function checks if a number is prime, and theprime_numbers_in_range
function finds all prime numbers in a given range. - Main Program: The program prompts the user to enter the start and end of the range. It then finds all prime numbers in the range using the
prime_numbers_in_range
function and prints the result.
Output
- When you run the above program, it will prompt you to enter the start and end of the range.
- After entering the range, it will find all prime numbers in that range and print the result.
Conclusion
- In this tutorial, we learned how to find all prime numbers in a given range using a Python program.
- Understanding this concept is essential for solving various mathematical problems and enhancing your programming skills.