AoPSWiki
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!

2008 AMC 12B Problems/Problem 20

From AoPSWiki

The following problem is from both the 2008 AMC 12B #20 and 2008 AMC 10B #25, so both problems redirect to this page.

Problem

Michael walks at the rate of 5 feet per second on a long straight path. Trash pails are located every 200 feet along the path. A garbage truck travels at 10 feet per second in the same direction as Michael and stops for 30 seconds at each pail. As Michael passes a pail, he notices the truck ahead of him just leaving the next pail. How many times will Michael and the truck meet?

\mathrm{(A)}\ 4\qquad\mathrm{(B)}\ 5\qquad\mathrm{(C)}\ 6\qquad\mathrm{(D)}\ 7\qquad\mathrm{(E)}\ 8

Solution

Pick a coordinate system where Michael's starting pail is 0 and the one where the truck starts is 200. Let M(t) and T(t) be the coordinates of Michael and the truck after t seconds. Let D(t)=T(t)-M(t) be their (signed) distance after t seconds. Meetings occur whenever D(t)=0. We have D(0)=200.

The truck always moves for 20 seconds, then stands still for 30. During the first 20 seconds of the cycle the truck moves by 200 meters and Michael by 100, hence during the first 20 seconds of the cycle D(t) increases by 100. During the remaining 30 seconds D(t) decreases by 150.

From this observation it is obvious that after four full cycles, i.e. at t=200, we will have D(t)=0 for the first time.

During the fifth cycle, D(t) will first grow from 0 to 100, then fall from 100 to -50. Hence Michael overtakes the truck while it is standing at the pail.

During the sixth cycle, D(t) will first grow from -50 to 50, then fall from 50 to -100. Hence the truck starts moving, overtakes Michael on their way to the next pail, and then Michael overtakes the truck while it is standing at the pail.

During the seventh cycle, D(t) will first grow from -100 to 0, then fall from 0 to -150. Hence the truck meets Michael at the moment when it arrives to the next pail.

Obviously, from this point on D(t) will always be negative, meaning that Michael is already too far ahead. Hence we found all \boxed{5} meetings.

The movement of Michael and the truck is plotted below: Michael in blue, the truck in red.

import graph;size(400,300,IgnoreAspect);real[] xt = new real[21];real[] yt = new real[21];for (int i=0; i<11; ++i) xt[2*i]...


See also

2008 AMC 12B (ProblemsResources)
Preceded by
Problem 19
Followed by
Problem 21
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
2008 AMC 10B (ProblemsResources)
Preceded by
Problem 24
Followed by
Last Question
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
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us