Difference between revisions of "2021 AIME I Problems/Problem 12"
MRENTHUSIASM (talk | contribs) m (→Solution: I revised this solution using 1-indexed instead of 0-indexed. This avoids discussing negatives. Also, I reformatted the equations. Hope things look better.) |
MRENTHUSIASM (talk | contribs) m (→Solution) |
||
| Line 3: | Line 3: | ||
==Solution== | ==Solution== | ||
| − | The expected number of minutes depends on the distances between the frogs | + | The expected number of minutes does not depend on the positions of the frogs, but depends on the distances between the frogs (in either clockwise or counterclockwise order). |
| − | Let <math>E(a,b,c)</math> denote the expected number of minutes for two frogs to arrive at the same vertex, such that the frogs are <math>a,b,</math> and <math>c</math> vertices away | + | Let <math>E(a,b,c)</math> denote the expected number of minutes for two frogs to arrive at the same vertex, such that the frogs are <math>a,b,</math> and <math>c</math> vertices away (in either clockwise or counterclockwise order). We wish to find <math>E(4,4,4).</math> |
Note that: | Note that: | ||
Revision as of 17:10, 8 July 2021
Problem
Let 
be a dodecagon (
-gon). Three frogs initially sit at 
and 
. At the end of each minute, simultaneously, each of the three frogs jumps to one of the two vertices adjacent to its current position, chosen randomly and independently with both choices being equally likely. All three frogs stop jumping as soon as two frogs arrive at the same vertex at the same time. The expected number of minutes until the frogs stop jumping is 
, where 
and 
are relatively prime positive integers. Find 
.
Solution
The expected number of minutes does not depend on the positions of the frogs, but depends on the distances between the frogs (in either clockwise or counterclockwise order).
Let 
denote the expected number of minutes for two frogs to arrive at the same vertex, such that the frogs are 
and 
vertices away (in either clockwise or counterclockwise order). We wish to find 
Note that:
for some nonnegative integers 
and 
if and only if at least one of or 
is 
- At the end of each minute, each frog has
possibilities. So, there are 
possibilities in total.
for some nonnegative integers 
if and only if at least one of 
possibilities. So, there are 
possibilities in total.
We have the following system of equations:
Rearranging and simplifying each equation, we get
Substituting 
and 
into 
we obtain ![\[E(2,4,6)=2+\frac{1}{4}\left[\frac{4}{3}+E(2,4,6)\right]+\frac{1}{4}\left[\frac{4}{3}+\frac{1}{3}E(2,4,6)\right],\]](http://latex.artofproblemsolving.com/5/3/8/538a8689508403bf582d64c79a6443797483ab3d.png)
from which 
Substituting this into gives 
Therefore, the answer is 
~Ross Gao (Fundamental Logic)
~MRENTHUSIASM (Reconstruction)
See Also
| 2021 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. 
