I'm trying to wrap my head around the logic of this test. In my head I'm trying to see if x is greater than 2 so it filters the numbers less than 2 and gives me the ones greater to test. Then to see if x is only divisible itself and 1 I find is hard to write. Also wouldn't "for n in x:" be correct, why the range when I've told it I need numbers greater than 2. Very sorry for my labyrinth of stupidity, I'm trying to apply the problem that's in my head into Python,

```
def is_prime(x):
if x < 2:
return False
elif x > 2:
return True
for n in range(2, x):
if x / x and x / 1:
return True
else:
return False
```