Ten nominees for an award are seated at a round table at a banquet. (a) Three awardees are chosen. How many different sets of three winners are possible? (b) There is actually a ranking among the three awardees, with first, second, and third places winning different prizes. How many different ordered slates of three winners are possible? (c) After the winners are announced, one nominee remarks to another, "Isn't it in- teresting that none of the winners were sitting next to each other?" How many ways are there to pick a set of three winners from the table, none of whom are seated next to one another? For this problem, we don't care who comes in first, second, and third. Hint: Define A; as the set of all outcomes where nominees i and i+ 1 are both chosen. The bad outcomes are then |A₁ U A₂ U... U A10| which seems like too much to ask via PIE, but luckily most intersections are very easy to count. For example, A₁ A₂] = 1 (why?) and A₁ A3] = 0.

Holt Mcdougal Larson Pre-algebra: Student Edition 2012
1st Edition
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Chapter12: Angle Relationships And Transformations
Section: Chapter Questions
Problem 3PTTS
icon
Related questions
Question
Ten nominees for an award are seated at a round table at a banquet.
(a) Three awardees are chosen. How many different sets of three winners are possible?
(b) There is actually a ranking among the three awardees, with first, second, and
third places winning different prizes. How many different ordered slates of three
winners are possible?
(c) After the winners are announced, one nominee remarks to another, “Isn't it in-
teresting that none of the winners were sitting next to each other?" How many
ways are there to pick set of three winners from the table, none of whom are
seated next to one another? For this problem, we don't care who comes in first,
second, and third.
Hint: Define A; as the set of all outcomes where nominees i and i + 1 are both
chosen. The bad outcomes are then |A₁ U A₂ U... U A₁0| which seems like too
much to ask via PIE, but luckily most intersections are very easy to count. For
example, |A₁ A₂| = 1 (why?) and |A₁ ^ A3| = 0.
Transcribed Image Text:Ten nominees for an award are seated at a round table at a banquet. (a) Three awardees are chosen. How many different sets of three winners are possible? (b) There is actually a ranking among the three awardees, with first, second, and third places winning different prizes. How many different ordered slates of three winners are possible? (c) After the winners are announced, one nominee remarks to another, “Isn't it in- teresting that none of the winners were sitting next to each other?" How many ways are there to pick set of three winners from the table, none of whom are seated next to one another? For this problem, we don't care who comes in first, second, and third. Hint: Define A; as the set of all outcomes where nominees i and i + 1 are both chosen. The bad outcomes are then |A₁ U A₂ U... U A₁0| which seems like too much to ask via PIE, but luckily most intersections are very easy to count. For example, |A₁ A₂| = 1 (why?) and |A₁ ^ A3| = 0.
Expert Solution
steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Recommended textbooks for you
Holt Mcdougal Larson Pre-algebra: Student Edition…
Holt Mcdougal Larson Pre-algebra: Student Edition…
Algebra
ISBN:
9780547587776
Author:
HOLT MCDOUGAL
Publisher:
HOLT MCDOUGAL
College Algebra
College Algebra
Algebra
ISBN:
9781938168383
Author:
Jay Abramson
Publisher:
OpenStax
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning