from math import *

def is_prime (x):

n = 1

cnt = 0

if x == 0 or x ==1 or x ==4:

return False

if x == 2 or x ==3:

return True

```
while n<= ceil(sqrt(x) and x > 4):
if (x / n) - ceil(x/n) == 0:
cnt += 1
if cnt == 2:
return False
break
n+=1
else:
return True
```

can someone explain to me why this function wont return true for prime numbers and false for numbers that could be divided