Euler #53 Combinatoric selections

euler53.py

from math import factorial

def numCombinations(n, r):
    return factorial(n) // (factorial(r) * factorial(n - r))

def numCombinationsBiggerThan(n, target):
    amount = 0
    for r in range(1, n + 1):
        if numCombinations(n, r) > target:
            amount += 1
    return amount

target = 10**6
result = sum(
    numCombinationsBiggerThan(n, target) for n in range(1, 101)
)
print(f"Total combinations bigger than a million for n <= 100: {result}")