SOLUTION: Ahcène, Nabil and Paul play each other in a tournament. Each game has a winner and a loser. The winner of the tournament is the first to win 10 games and the tournament ends when a

Algebra ->  Customizable Word Problem Solvers  -> Misc -> SOLUTION: Ahcène, Nabil and Paul play each other in a tournament. Each game has a winner and a loser. The winner of the tournament is the first to win 10 games and the tournament ends when a      Log On

Ad: Over 600 Algebra Word Problems at edhelper.com


    

Question 291049: Ahcène, Nabil and Paul play each other in a tournament. Each game has a winner and a loser. The winner of the tournament is the first to win 10 games and the tournament ends when a winner is found. They play each other in the order: Ahcène vs. Nabil, Ahcène vs. Paul, and Nabil vs. Paul, repeating this order until the tournament ends. What is the smallest possible number of games in the tournament?
(A) 10 (B) 13 (C) 14 (D) 15 (E) 20
Answer by richwmiller(17219) About Me  (Show Source):
You can put this solution on YOUR website!
n,n x
n,n,x
n,n,x
n,n,x
n,n
(C) 14