No error. It just stops running, no reject or pass.
As I though it could pass, considering I following the instructions and came up with the n-list in which all numbers from 2 to x-1 are listed. With the for loop I go through this list in the modulo.
I though I was pretty cunning there, with the small details that it doesn't work
Can somebody help me out, using as much of my Original code? (or explain me why it isn't the right approach).
Thanks a million!
def is_prime(x): n = list(range(2,x-1)) if x < 2: return False else: for number in n: if x % number < 0 return False else: return True