Chapter 1: Problem 28
If 8 new teachers are to be divided among 4 schools, how many divisions are possible? What if each school must receive 2 teachers?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 1: Problem 28
If 8 new teachers are to be divided among 4 schools, how many divisions are possible? What if each school must receive 2 teachers?
All the tools & learning materials you need for study success - in one app.
Get started for free
Show that for \(n>0\) $$ \sum_{i=0}^{n}(-1)^{i}\left(\begin{array}{l} n \\ i \end{array}\right)=0 $$ HINT: Use the binomial theorem.
From a group of \(n\) people, suppose that we want to choose a committee of \(k, k \leq n\), one of whom is to be designated as chairperson. (a) By focusing first on the choice of the committee and then on the choice of the chair, argue that there are \(\left(\begin{array}{l}n \\\ k\end{array}\right) k\) possible choices. (b) By focusing first on the choice of the nonchair committee members and then on the choice of the chair, argue that there are \(\left(\begin{array}{c}n \\\ k-1\end{array}\right)(n-k+1)\) possible choices. (c) By focusing first on the choice of the chair and then on the choice of the other committee members, argue that there are \(n\left(\begin{array}{l}n-1 \\\ k-1\end{array}\right)\) possible choices. (d) Conclude from parts (a), (b), and (c) that $$ k\left(\begin{array}{l} n \\ k \end{array}\right)=(n-k+1)\left(\begin{array}{c} n \\ k-1 \end{array}\right)=n\left(\begin{array}{l} n-1 \\ k-1 \end{array}\right) $$ (e) Use the factorial definition of \(\left(\begin{array}{l}m \\\ r\end{array}\right)\) to verify the identity in part (d).
The game of bridge is played by 4 players, each of whom is dealt 13 cards. How many bridge deals are possible?
Two experiments are to be performed. The first can result in any one of \(m\) possible outcomes. If the first experiment results in outcome number \(i\), then the second experiment can result in any of \(n_{i}\) possible outcomes, \(i=1\), \(2, \ldots, m\). What is the number of possible outcomes of the two experiments?
We have 20 thousand dollars that must be invested among 4 possible opportunities. Each investment must be integral in units of 1 thousand dollars, and there are minimal investments that need to be made if one is to invest in these opportunities. The minimal investments are \(2,2,3\), and 4 thousand dollars. How many different investment strategies are available if (a) an investment must be made in each opportunity; (b) investments must be made in at least 3 of the 4 opportunities?
What do you think about this solution?
We value your feedback to improve our textbook solutions.