How can you make this algorithm work faster

Question

I know that you can simplify it by dividing only by prime numbers, when checking a number, but I'm not sure, how to make it in python. Have you any ideas how to do this, or how to simplify mu algorithms in other ways?

https://code.sololearn.com/cdhtsOU97lBK/?ref=app

Answer 1

try doing both of these, they both worked for me:
sq rt(n + 1) or sq rt(n) + 1

Answer 2

thanks