The crux of the combinatorial proof of Pascals formula is
Chapter 9, Problem 9.214(choose chapter or problem)
The crux of the combinatorial proof of Pascals formula is that the set of subsets of size r of a set {x1,x2,...,xn+1} can be partitioned into the set of subsets of size r that contain _____ and those that _____.
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