   Chapter 9.7, Problem 4TY ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# The crux of the combinatorial proof of Pascal’s formula is that the set of subsets of size r of a set { x 1 , x 2 , ... , x n + 1 } can be partitioned into the set of subsets of size r that contain_______and the set of subsets of size r that_______

To determine

To fill in the blanks of the statement “The crux of the combinatorial proof of Pascal’s 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 the set of subsets of size r that .”

Explanation

Given:

The statement “The crux of the combinatorial proof of Pascal’s 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 the set of subsets of size r that .”

In the combinatorial proof of Pascal’s formula that is, (n+1r)=(nr1)+(nr) subsets of size r of {x1,x2,..........,xn+1} can be partitioned into two pieces, they are subsets of size r that consist entirely of elements from {x1,x2,

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 