@netninja64558. Let me take a stab at explaining your code.

First, I'd like to say you're code helped me solve this problem, and while explaining it to myself, I think I have an answer for you.

Every function needs a 'return' value. the last 'return' has only one tab, thus corresponding to the final 'return' the function needs to execute.

I treated this as a for-else loop. "For a given parameter, test to see if it's prime by checking for a remainder of 0. If I get a remainder of 0, 'is_prime' should return false. If there is a remainder of non-zero, it's not evenly divisible. i.e. is_prime should return True.

```
def is_prime(x):
if x < 2:
return False
for n in range(2, (x-1)):
if x % n == 0:
return False
else:
return True
```