Art of Problem Solving
Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2016 AMC 8 Problems/Problem 18: Difference between revisions

← Older edit
GeronimoStilton (talk | contribs)
editor
94 edits
No edit summary
Aoum (talk | contribs)
editor
4,951 edits
Categorized problem
 
(14 intermediate revisions by 10 users not shown)
Line 1: Line 1:
==Problem==
In an All-Area track meet, <math>216</math> sprinters enter a <math>100-</math>meter dash competition. The track has <math>6</math> lanes, so only <math>6</math> sprinters can compete at a time. At the end of each race, the five non-winners are eliminated, and the winner will compete again in a later race. How many races are needed to determine the champion sprinter?
In an All-Area track meet, <math>216</math> sprinters enter a <math>100-</math>meter dash competition. The track has <math>6</math> lanes, so only <math>6</math> sprinters can compete at a time. At the end of each race, the five non-winners are eliminated, and the winner will compete again in a later race. How many races are needed to determine the champion sprinter?


<math>\textbf{(A)}\mbox{ }36\qquad\textbf{(B)}\mbox{ }42\qquad\textbf{(C)}\mbox{ }43\qquad\textbf{(D)}\mbox{ }60\qquad\textbf{(E)}\mbox{ }72</math>


<math>\textbf{(A)}\mbox{ }36\qquad\textbf{(B)}\mbox{ }42\qquad\textbf{(C)}\mbox{ }43\qquad\textbf{(D)}\mbox{ }60\qquad\textbf{(E)}\mbox{ }72</math>
==Solution==
==Solution==
===Solution 1===
From any <math>n-</math>th race, only <math>\frac{1}{6}</math> will continue on. Since we wish to find the total number of races, a column representing the races over time is ideal.
From any <math>n-</math>th race, only <math>\frac{1}{6}</math> will continue on. Since we wish to find the total number of races, a column representing the races over time is ideal.
Starting with the first race:
Starting with the first race:
Line 9: Line 11:
<cmath>\frac{36}{6}=6</cmath>
<cmath>\frac{36}{6}=6</cmath>
<cmath>\frac{6}{6}=1</cmath>
<cmath>\frac{6}{6}=1</cmath>
Adding all of the numbers in the second column yields <math>43 \rightarrow \boxed{C}</math>
Adding all of the numbers in the second column yields <math>\boxed{\textbf{(C)}\ 43}</math>
 
===Solution 2===
Every race eliminates <math>5</math> players. The winner is decided when there is only <math>1</math> runner left. You can construct the equation: <math>216</math> - <math>5x</math> = <math>1</math>. Thus, <math>215</math> players have to be eliminated. Therefore, we need <math>\frac{215}{5}</math> games to decide the winner, or <math>\boxed{\textbf{(C)}\ 43}</math>
 
==See Also==
{{AMC8 box|year=2016|num-b=17|num-a=19}}
{{AMC8 box|year=2016|num-b=17|num-a=19}}
{{MAA Notice}}\end{align}
{{MAA Notice}}
[[Category:Introductory Algebra Problems]]

Latest revision as of 17:15, 25 June 2025

Problem

In an All-Area track meet, $216$ sprinters enter a $100-$meter dash competition. The track has $6$ lanes, so only $6$ sprinters can compete at a time. At the end of each race, the five non-winners are eliminated, and the winner will compete again in a later race. How many races are needed to determine the champion sprinter?

$\textbf{(A)}\mbox{ }36\qquad\textbf{(B)}\mbox{ }42\qquad\textbf{(C)}\mbox{ }43\qquad\textbf{(D)}\mbox{ }60\qquad\textbf{(E)}\mbox{ }72$

Solution

Solution 1

From any $n-$th race, only $\frac{1}{6}$ will continue on. Since we wish to find the total number of races, a column representing the races over time is ideal. Starting with the first race: \[\frac{216}{6}=36\] \[\frac{36}{6}=6\] \[\frac{6}{6}=1\] Adding all of the numbers in the second column yields $\boxed{\textbf{(C)}\ 43}$

Solution 2

Every race eliminates $5$ players. The winner is decided when there is only $1$ runner left. You can construct the equation: $216$ - $5x$ = $1$. Thus, $215$ players have to be eliminated. Therefore, we need $\frac{215}{5}$ games to decide the winner, or $\boxed{\textbf{(C)}\ 43}$

See Also

2016 AMC 8 (Problems • Answer Key • Resources)
Preceded by
Problem 17 		Followed by
Problem 19
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AJHSME/AMC 8 Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: File missing

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2016_AMC_8_Problems/Problem_18&oldid=252331"