Chapter 1: Problem 13
In how many ways can we distribute eight identical white balls into four distinct containers so that (a) no container is left empty? (b) the fourth container has an odd number of balls in it?
/*! 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 13
In how many ways can we distribute eight identical white balls into four distinct containers so that (a) no container is left empty? (b) the fourth container has an odd number of balls in it?
All the tools & learning materials you need for study success - in one app.
Get started for free
Patter's Pastry Parlor offers eight different kinds of pastry and six different kinds of muffins. In addition to bakery items one can purchase small, medium, or large containers of the following beverages: coffee (black, with cream, with sugar, or with cream and sugar), tea (plain, with cream, with sugar, with cream and sugar, with lemon, or with lemon and sugar), hot cocoa, and orange juice. When Carol comes to Patter's, in how many ways can she order a) one bakery item and one medium-sized beverage for herself? b) one bakery item and one container of coffee for herself and one muffin and one container of tea for her boss, Ms. Didio? c) one piece of pastry and one container of tea for herself, one muffin and a container of orange juice for Ms. Didio, and one bakery item and one container of coffee for each of her two assistants, Mr. Talbot and Mrs. Gillis?
For every positive integer \(n\), show that $$ \left(\begin{array}{l} n \\ 0 \end{array}\right)+\left(\begin{array}{l} n \\ 2 \end{array}\right)+\left(\begin{array}{l} n \\ 4 \end{array}\right)+\cdots=\left(\begin{array}{l} n \\ 1 \end{array}\right)+\left(\begin{array}{l} n \\ 3 \end{array}\right)+\left(\begin{array}{l} n \\ 5 \end{array}\right)+\cdots $$
a) Find the number of ways to write 17 as a sum of \(1^{\prime} s\) and 2 's if order is relevant. b) Answer part (a) for 18 in place of 17 . c) Generalize the results in parts (a) and (b) for \(n\) odd and for \(n\) even.
Find the value of \(s u m\) after the given program segment is executed. (Here \(i, j, k\), increment, and sum are integer variables.) $$ \begin{aligned} &\text { increment }:=0 \\ &\text { sum }:=0 \\ &\text { for } i:=1 \text { to } 10 \text { do } \\ &\text { for } j:=1 \text { to i do } \\ &\text { for } k:=1 \text { to } j \text { do } \\ &\text { begin } \\ &\text { increment : }=\text { increment }+1 \\ &\text { sum }:=\text { sum }+\text { increment } \\ &\text { end } \end{aligned} $$
In how many ways can a gambler draw five cards from a standard deck and get (a) a flush (five cards of the same suit)? (b) four aces? (c) four of a kind? (d) three aces and two jacks? (e) three aces and a pair? (f) a full house (three of a kind and a. pair)? (g) three of a kind? (h) two pairs?
What do you think about this solution?
We value your feedback to improve our textbook solutions.