Difference between revisions of "2008 AIME I Problems/Problem 12"
Sugar rush (talk | contribs) |
Sugar rush (talk | contribs) |
||
| Line 14: | Line 14: | ||
Disclaimer: This is for the people who may not understand calculus, and is also how I did it. | Disclaimer: This is for the people who may not understand calculus, and is also how I did it. | ||
First, we assume several things. First, we assume the speeds must be multiples of 15 to maximize cars, because any less will be a waste. Second, we start with one car in front of the photoelectric eye. | First, we assume several things. First, we assume the speeds must be multiples of 15 to maximize cars, because any less will be a waste. Second, we start with one car in front of the photoelectric eye. | ||
| − | We first set the speed of the cars as <math>15k</math>. Then, the distance between them is <math>\frac{4}{1000} \times k\km</math>. Therefore, it takes the car closest to the eye not on the eye <math>\frac{\frac{k}{250}}{15k}</math> hours to get to the eye. There is one hour, so the amount of cars that can pass is <math>\frac{1}{\frac{\frac{k}{250}}{15k}}</math>, or <math>3750</math> cars. When divided by ten, you get the quotient of <math>\boxed{375}</math> | + | We first set the speed of the cars as <math>15k</math>. Then, the distance between them is <math>\frac{4}{1000} \times k\text{km}</math>. Therefore, it takes the car closest to the eye not on the eye <math>\frac{\frac{k}{250}}{15k}</math> hours to get to the eye. There is one hour, so the amount of cars that can pass is <math>\frac{1}{\frac{\frac{k}{250}}{15k}}</math>, or <math>3750</math> cars. When divided by ten, you get the quotient of <math>\boxed{375}</math> |
== See also == | == See also == | ||
Revision as of 15:33, 7 December 2020
Contents
Problem
On a long straight stretch of one-way single-lane highway, cars all travel at the same speed and all obey the safety rule: the distance from the back of the car ahead to the front of the car behind is exactly one car length for each 15 kilometers per hour of speed or fraction thereof (Thus the front of a car traveling 52 kilometers per hour will be four car lengths behind the back of the car in front of it.) A photoelectric eye by the side of the road counts the number of cars that pass in one hour. Assuming that each car is 4 meters long and that the cars can travel at any speed, let 
be the maximum whole number of cars that can pass the photoelectric eye in one hour. Find the quotient when is divided by 
.
Solution 1
Let 
be the number of car lengths that separates each car. Then their speed is at most 
. Let a unit be the distance between the cars (front to front). Then the length of each unit is 
. To maximize, in a unit, the CAR comes first, THEN the empty space. So at time zero, the car is right at the eye.
Hence, we count the number of units that pass the eye in an hour: 
. We wish to maximize this.
Observe that as gets larger, the 
gets less and less significant, so we take the limit as approaches infinity
Now, as the speeds are clearly finite, we can never actually reach 
full UNITs. However, we only need to find the number of CARS. We can increase their speed so that the camera stops (one hour goes by) after the car part of the th unit has passed, but not all of the space behind it. Hence, cars is possible, and the answer is 
.
Solution 2
Disclaimer: This is for the people who may not understand calculus, and is also how I did it.
First, we assume several things. First, we assume the speeds must be multiples of 15 to maximize cars, because any less will be a waste. Second, we start with one car in front of the photoelectric eye.
We first set the speed of the cars as 
. Then, the distance between them is 
. Therefore, it takes the car closest to the eye not on the eye 
hours to get to the eye. There is one hour, so the amount of cars that can pass is 
, or cars. When divided by ten, you get the quotient of 
See also
| 2008 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 11 |
Followed by Problem 13 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
