Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
pow(x, y, modulo) solution in Clear category for Restricted Prime by David_Jones
ONE = True
TWO = ONE + ONE
mod = lambda x,y: pow(x,ONE,y)
def checkio(number):
d = TWO
while d ** TWO <= number:
if not mod(number, d):
return False
d += ONE
return True
June 10, 2019
