Combinations
Counts combinations C(n,k) = n! / (k!(n-k)!) regardless of order.
C(n,k)
120
Advertisement
Formula
C(n, k) = n! / (k! × (n − k)!)
Example: C(10, 3) = 120
Methodology
C(n,k) = n! / (k!(n−k)!) regardless of order.
Example
C(10,3) = 120.
Counts combinations C(n,k) = n! / (k!(n-k)!) regardless of order.
C(n,k)
120
Advertisement
C(n, k) = n! / (k! × (n − k)!)
Example: C(10, 3) = 120
C(n,k) = n! / (k!(n−k)!) regardless of order.
C(10,3) = 120.