A Python program to display all prime numbers up to a range given by the user.

A prime number is a positive integer greater than 1 that has no positive integer divisors other than 1 and itself. In other words, a prime number is a number that can only be evenly divided by 1 and itself.

For example, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, and 31 are the first few prime numbers. Note that 1 is not considered a prime number, as it only has one positive divisor (1) and does not meet the definition of a prime number.

 Here's a Python program to display all prime numbers up to a range given by the user:

python
# Function to check if a number is prime
def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

# Get the upper limit from the user
limit = int(input("Enter the upper limit: "))

# Print all prime numbers up to the limit
print("Prime numbers up to", limit, "are:")
for i in range(2, limit+1):
    if is_prime(i):
        print(i)

In this program, I first define a function is_prime() to check if a number is prime or not. This function takes a number n as input and returns True if it's prime, or False if it's not.

I then ask the user to enter an upper limit for the range of numbers to check. I use a for loop to iterate over all numbers from 2 up to the limit, and call the is_prime() function on each number. If the function returns True, I print the number as a prime number.

Note that I use the square root of n to limit the number of divisors I need to check in the is_prime() function, as any factor of n greater than sqrt(n) must have a corresponding factor less than sqrt(n) to form a pair.