xxxxxxxxxx
# First, we will take the input:
lower_value = int(input ("Please, Enter the Lowest Range Value: "))
upper_value = int(input ("Please, Enter the Upper Range Value: "))
print ("The Prime Numbers in the range are: ")
for number in range (lower_value, upper_value + 1):
if number > 1:
for i in range (2, number):
if (number % i) == 0:
break
else:
print (number)
python program
xxxxxxxxxx
• bool prime[100001];
memset(prime,true,sizeof(prime));
prime[0]=prime[1]=false;
for(long long p=2;p*p<=100000;p++){
if(prime[p]==true){
for(int i=p*p;i<=100000;i+=p){
prime[i]=false;
}
}
}
xxxxxxxxxx
def is_prime(num):
if num < 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True
def find_prime_numbers(start, end):
prime_numbers = []
for num in range(start, end + 1):
if is_prime(num):
prime_numbers.append(num)
return prime_numbers
# Example usage:
start_range = 10
end_range = 50
result = find_prime_numbers(start_range, end_range)
print(result) # Output: [11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
xxxxxxxxxx
def is_prime(num):
if num < 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True
def print_prime_numbers(start, end):
prime_nums = []
for num in range(start, end + 1):
if is_prime(num):
prime_nums.append(num)
print(prime_nums)
# Example usage
start_num = 1
end_num = 100
print_prime_numbers(start_num, end_num)