Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 6 - Section 6.6 - Generating Permutations and Combinations - Review Questions - Page 440: 4

Answer

70

Work Step by Step

We try to find ways in which the first team can win and then multiply that solution with 2. So for team 1 to win the competition, team 1 has to win 4 games and team 2 can win 0,1,2,3 games. This can be done in C(7,3)= 35 Remember that C(7,3) already includes the cases when team 2 wins 0,1,2, times. So total possible outcomes = 35$\times$2 = 70.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.

GradeSaver will pay $15 for your literature essays
GradeSaver will pay $25 for your college application essays
GradeSaver will pay $50 for your graduate school essays – Law, Business, or Medical
GradeSaver will pay $10 for your Community Note contributions
GradeSaver will pay $500 for your Textbook Answer contributions