Probability
N choose K
C(n,k) = n! / ((n-k)! k!)
Can be reduced to:
C(n,k) = (n-1 choose k-1) + (n-1 choose k)
Can be solve recursively this way
C(n,k) = n! / ((n-k)! k!)
Can be reduced to:
C(n,k) = (n-1 choose k-1) + (n-1 choose k)
Can be solve recursively this way