def divis_through_twenty(n):
    return any(n % x for x in range(20, 1, -1))
x = 20
while divis_through_twenty(x):
    x += 20
How can I make this Project Euler solution execute in Python at the same speed as Java?