Chapter 6: Q2E (page 421)
Find the expansion of
a) using combinatorial reasoning, as in Example 1.
b) using the binomial theorem.
Chapter 6: Q2E (page 421)
Find the expansion of
a) using combinatorial reasoning, as in Example 1.
b) using the binomial theorem.
All the tools & learning materials you need for study success - in one app.
Get started for freeHow many subsets with an odd number of elements does a set withelements have?
One hundred tickets, numbered \(1,2,3, \ldots ,100\), are sold to \(100\) different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti). How many ways are there to award the prizes if
a) there are no restrictions?
b) the person holding ticket \(47\) wins the grand prize?
c) the person holding ticket \(47\) wins one of the prizes?
d) the person holding ticket \(47\) does not win a prize?
e) the people holding tickets \(19\) and \(47\) both win prizes?
f) the people holding tickets \(19\;,\;47\)and \(73\) all win prizes?
g) the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) all win prizes?
h) none of the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) wins a prize?
i) the grand prize winner is a person holding ticket \(19\;,\;47\;,\;73\) or \(97\)?
j) the people holding tickets 19 and 47 win prizes, but the people holding tickets \(73\) and \(97\) do not win prizes?
4. Every day a student randomly chooses a sandwich for lunch from a pile of wrapped sandwiches. If there are six kinds of sandwiches, how many different ways are there for the student to choose sandwiches for the seven days of a week if the order in which the sandwiches are chosen matters?
6. How many ways are there to select five unordered elements from a set with three elements when repetition is allowed?
How many bit strings of length \({\bf{10}}\) have
a) exactly three \(0s\)?
b) more \(0s\) than \(1s\) ?
c) at least seven \(1s\) ?
d) at least three \(1s\) ?
What do you think about this solution?
We value your feedback to improve our textbook solutions.