limit = int(input("Enter the nnumber of the prime numbers you want to see:"))
prime_numbers = [] # [2, 3]
prime = 2
while len(prime_numbers) < limit:
current_number = prime - 1
# check to find prime number
isPrime = True
while current_number > 1:
if prime % current_number == 0:
isPrime = False
break
current_number -= 1
if isPrime:
prime_numbers.append(prime)
prime += 1
print("Prime numbers until the given limit: ", prime_numbers)
# optimized
limit = int(input("Enter the nnumber of the prime numbers you want to see:"))
prime_numbers = [] # [2, 3]
prime = 2
while len(prime_numbers) < limit:
isPrime = True
if prime <= 1:
isPrime = False
elif prime <= 3:
isPrime = True
elif prime % 2 == 0 or prime % 3 == 0:
isPrime = False
i = 5
while i * i <= prime:
if prime % i == 0 or prime % (i + 2) == 0:
isPrime = False
break
i += 6
if isPrime:
prime_numbers.append(prime)
prime += 1
print("Prime numbers until the given limit: ", prime_numbers)
