Not sure if I should\'ve posted this on math.stackexchange instead, but it includes more programming so I posted it here.
The question seems really simple, but I\'ve
I like this the most:
def divisibles(below, *divisors): return (n for n in xrange(below) if 0 in (n % d for d in divisors)) print sum(divisibles(1000, 3, 5))