Smallest Multiple [Project Euler] [Python]

[AustinB]

I'm running this code that in theory shouldn't take longer than an minute, but I've ran it for at least 5 min with no results. Am I missing a infinite loop or something similar? Thanks in advanced.

import time as tdef check(x):    for i in range(11,21):        if x % i == 0:            continue        else:            return False        return Truex =  2520while not check(x):    x += 2520print (x)t.sleep(100)

More info: https://projecteuler.net/problem=5

 

P.S. I don't want you to give me the answer.

[fizzlesticks]

Your check function will never return True, it will either be False or None.

[AustinB]

Your check function will never return True, it will either be False or None.

Thanks, gotta love non-syntax errors. Not going to say the solution as it is a Project Euler question.

[fizzlesticks]

Thanks, gotta love non-syntax errors.

Using a good IDE like Visual Studio or PyCharm would catch those things for you.

[AustinB]

Using a good IDE like Visual Studio or PyCharm would catch those things for you.

Been using Atom, cause when I initially tried downloading PyCharm it  would quit the download half way through. Getting kind of sick of not having a debugger to read from and spamming the app to read the error. Thanks

[olbaze]

One elementary way to diagnose stuff like this is to spam print statements.

[Nineshadow]

This can be done pretty easily mathematically.

 

Also, another way of doing it would be to calculate the smallest common factor of the numbers.

[LukeTim]

Thanks, gotta love non-syntax errors. Not going to say the solution as it is a Project Euler question.

 

Just FYI, non-syntax errors are known as semantic errors.