challenge: generators python

Question

def isPrime(x):
if x < 2:
return False
elif x == 2:
return True
for n in range(2, x):
if x % n ==0:
return False
return True
def primeGenerator(a, b):
#your code goes here
f = int(input())
t = int(input())
print(list(primeGenerator(f, t)))
I dont know why my code's wrong in test case 4

Answer 1

someone helps my problem

Answer 2

Does your range need to be inclusive of the upper number according to the challenge description?
for n in range(2,x+1)