An alternative way to derive Theorem uses the following
Chapter 9, Problem 29E(choose chapter or problem)
Problem 29E
An alternative way to derive Theorem uses the following division rule: Let n and k be integers so that k divides n. If a set consisting of n elements is divided into subsets that each contain k elements, then the number of such subsets is n/k. Explain how Theorem can be derived using the division rule.
Theorem
The number of subsets of size r (or r-combinations) that can be chosen from a set of n elements, , is given by the formula or, equivalently, where n and r are nonnegative integers with r ≤ n.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer