Euler(1)

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below 1000.

 

def getSum(max,a,b):
    def _getSumOfMultiples(num):
        if max>=num:
            return (num+int(max/num)*num)*(max/num) /2
        return 0
   
    def _isMultiple():
        if a%b ==0 :
            return b
        if b%a ==0 :
            return a
        return 0
    min = _isMultiple()
    if min == 0:
        sumOfMultA = _getSumOfMultiples(a)
        sumOfMultB = _getSumOfMultiples(b)
        sumOfMultAAndB = _getSumOfMultiples(a*b)
        return sumOfMultA + sumOfMultB - sumOfMultAAndB
    return _getSumOfMultiples(min)