Counting and Probability
Combinations C(n,k)
Number of unordered k-subsets of an n-set: C(n,k) = n!/(k!(n−k)!); satisfies Pascal's identity and symmetry C(n,k) = C(n,n−k).
0
Contest appearances
100
Practice problems
1–10
Difficulty levels
Drill this topic
Sign in and tell the coach to drill this knowledge point — it picks questions matched to your current level.