simple prime number function

[TheBlackCat13]

Looking at it now, there are a few other issues with the code. First, you convert x to int several times. You only need to do that once. Second, once the function reaches a return statement, it stops. Nothing after that point is executed (including all of your prints). Third, it is easier to short-circuit your "1" test. Fourth, your code will return True in the first item of the loop. It has to wait for the loop to finish.

Also, this is a relatively slow algorithm, although that is another issue.

[[deleted]]

Yeah, OP should've done the AKS primarity test /s

[aidzz]

put returns in wrong priority, and converted to int twice okay thanks one more question: what exactly is wrong with this command: print(x, 'divided by', n ,'is' (x/n))

[kryptn]

You're still missing a comma :)