find all prime numbers in a range code example

Example 1: the list of prime number in a given range python

n=int(input("Enter the number till you want to check: "))
primes = []
for i in range (2, n+1):
    for j in range(2, i):
        if i%j == 0:
            break
    else:
        primes.append(i)
print(primes)

Example 2: display prime numbers between two intervals in python

lowernum = int(input(“Enter your lower number”))
uppernum = int(input(“Enter your upper number”))
for num in range(lowernum,uppernum +1):
  if num> 1:
     for num in range(2,num):
        if (num % 1) == 0:
                    break
            else:
                print(num)

Example 3: first prime numbers less than

#include<bits/stdc++.h>
using namespace std;
bool Is_Prime(long long x){
	if(x%2==0)return false;
	for(int i=3;i*i<=x;i+=2)
		if(x%i==0)return false;
	return true;
}
int main(){
	//primes less than n
	int n;
	cin>>n;
	int primes=0,i=1;
	while(primes++<n){
		while(!Is_Prime(++i));
		cout<<i<<" ";
	}
}