Problem-Set-2-Discrete (1)
Problem-Set-2-Discrete (1)
Name:
2. _____The binomial coefficient (n choose r) is always greater than or equal to 1 for all non-negative
integers n and r.
3. _____The number of ways to distribute n identical objects into r distinct groups is given by
(n+ r−1
r−1
.)
4. _____The number of ways to choose 3 objects from a set of 5 is the same as the number of ways to
leave out 2 objects from the set.
n
5. _____The binomial theorem states that ( x + y ) =∑
n
r=0 r
()
n xr y n−r
.
7. _____If a set contains n distinct elements, the number of non-empty subsets is 2n−1 .
11!
8. _____The number of ways to arrange the letters in MISSISSIPPI is .
4! 4!2!
9. _____A partition of a set is a way of dividing the set into non-overlapping and non-empty subsets.
Column A Column B
1. ()
n
r
A. Number of ways to arrange n objects in
a line
2. n! B. Number of subsets of an n-element set
3. Binomial Theorem C. A way of distributing n identical
objects into r groups
4. Stirling Number of the Second Kind D. A formula for expanding ( x + y )n
5. Permutation E. The number of ways to partition n
objects into k subsets
6. Partition F. The number of ways to choose r objects
from n without order
7. Combination G. The number of ways to divide a set
into non-overlapping subsets
8. Power Set H. The total number of elements in the
subsets of a set
9. Multinomial Coefficient I. The number of ways to distribute n
objects into labeled bins
10. Stars and Bars J. The number of ways to arrange
indistinguishable objects
1. (a) How many ways can a teacher select a group of 4 students from a class of 12?
(b) If the 4 selected students will be assigned specific roles (captain, vice-captain, secretary, and
treasurer), in how many ways can these roles be assigned?
3. In how many ways can 10 identical candies be distributed among 4 children such that each child
gets at least one candy?