from math import sqrt
N = int(raw_input())
maximum,minimum = [int(x) for x in raw_input().split()]
def PrimeGenerator(x,y):
primes = [2]
for item in range(3,y,2):
isprime = True
a = sqrt(item) + 1
for divisor in primes:
if divisor >= a:
break
if item % divisor ==0:
isprime = False
break
else:
primes.append(item)
return primes
while N:
N-=1
prime_Number = PrimeGenerator(maximum,minimum)
for number in prime_Number:
print number
The output gives multiples of 9 too..
created
last reply
- 2
replies
- 247
views
- 3
users