You are viewing a single comment's thread. Return to all comments →
def isprime(n):
if n<2 : return(False) if n==2 : return(False) for i in range(3,int(n**0.5) +1,2) : if n%i==0 : return(False) return(True)
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #46: Goldbach's other conjecture
You are viewing a single comment's thread. Return to all comments →
def isprime(n):