maximum recursion depth exceeded in comparison

Question

I wrote this piece of code to compute the number of combinations:

def fact(n):
    return 1 if(n == 1) else n * fact(n - 1)

def combinations(n,k):
    retur         


        

Answer 1

something like this works well:

def factorial_by_recursion(max_number, current_number, somme):
    if current_number < max_number:
        somme += current_number
        return factorial_by_recursion(max_number, current_number + 1, somme)
    else:
        return somme