Python

exercise 15's factorial function:

def factorial(x): if x == 0: # if x is 0 return 1 # then recursion stops and returns 1 else: return x * factorial(x - 1) # here is the recursive call 

Make a function that computes the number of combinations for k items within n samples: () = (-) with the factorial function you wrote in Exercise 15 nested within it with a different name). Remember to code in a check that n is larger than k