Testing divisibility by multiple numbers

Question

In Python, is there a way to test if a number is divisible by multiple numbers without writing out the modulo operation for each factor?

More specifically, is there a better way to write this code instead of typing i % n == 0 ninety times?

if i % 11 == 0 and i % 12 == 0 and i % 13 == 0 ... and i % 100 == 0:
    print(i)

Thanks!

Answer 1

Useall()and a Generator Expression:

if all(i % n == 0 for n in range(11, 101)):
    print(i)

Answer 2

if all(i % n == 0 for n in reversed(xrange(11, 101))):
    print(i)

Only a slightly modified version of the duplicate answers already given: xrange returns an object that generates the numbers in the range on demand (slightly faster than range and more memory efficient). If performance is important here, which it often is for mathematical code snippets like this bit, the reverse iterator will check the bigger numbers first. This is more likely to kick you out of the all() function sooner.