(a) In how many ways can Team A win? (b) What if the tournament goes all 7 games? So Team A wins the last game. How many ways can the first 6 games go down? (c) What if the tourney goes 6 games? So Team A wins the 6th game which ends the series. How many ways can this happen? What about 5 games? 4 games? (d) Using parts (a)-(c), write two different ways to compute the number of ways Team A can win. Write an equation involving binomial coefficients in the form (2). (e) Write the general formula for an n game tournament with k wins required to be named champion.

(a) In how many ways can Team A win? (b) What if the tournament goes all 7 games? So Team A wins the last game. How many ways can the first 6 games go down? (c) What if the tourney goes 6 games? So Team A wins the 6th game which ends the series. How many ways can this happen? What about 5 games? 4 games? (d) Using parts (a)-(c), write two different ways to compute the number of ways Team A can win. Write an equation involving binomial coefficients in the form (2). (e) Write the general formula for an n game tournament with k wins required to be named champion.

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 15PTTS

See similar textbooks