Difference between revisions of "2007 AIME I Problems/Problem 6"
5849206328x (talk | contribs) m (→Solution 2) |
|||
| Line 78: | Line 78: | ||
[[Category:Intermediate Combinatorics Problems]] | [[Category:Intermediate Combinatorics Problems]] | ||
| + | {{MAA Notice}} | ||
Revision as of 19:09, 4 July 2013
Problem
A frog is placed at the origin on the number line, and moves according to the following rule: in a given move, the frog advances to either the closest point with a greater integer coordinate that is a multiple of 3, or to the closest point with a greater integer coordinate that is a multiple of 13. A move sequence is a sequence of coordinates which correspond to valid moves, beginning with 0, and ending with 39. For example, 
is a move sequence. How many move sequences are possible for the frog?
Solution
Solution 1
Let us keep a careful tree of the possible number of paths around every multiple of 
.
From 
, we can end at either 
(mult. of 3) or (mult. of 13).
- Only
path leads to 
- Continuing from , there is
way to continue to 
- There are
ways to reach 
.
- Continuing from
- There are
ways to reach 
.
- Continuing from , there are
ways to get to - There are
ways (the first 1 to make it inclusive, the second to also jump from 
) to get to .
- Continuing from
path leads to 
way to continue to 
ways to reach 
ways to reach 
ways to get to 
ways (the first 1 to make it inclusive, the second to also jump from 
) to get to Regrouping, work from 
- There are
ways to get to
- Continuing from , there are
ways to continue to 
.
- Continuing from
- There are
ways to reach .
- Continuing from , there are
(note that the 1 is not to inclusive, but to count 
).
- Continuing from
ways to get to 
ways to continue to 
ways to reach 
(note that the 1 is not to inclusive, but to count 
).In total, we get 
.
In summary, we can draw the following tree, where in 
, 
represents the current position on the number line, and 
represents the number of paths to get there:
|
|
|
Again, this totals 
.
Solution 2
We divide it into 3 stages. The first occurs before the frog moves past 13. The second occurs before it moves past 26, and the last is everything else.
For the first stage the possible paths are 
, 
, 
, 
, 
, and 
. That is a total of 6.
For the second stage the possible paths are 
, 
, 
, 
, 
, and 
. That is a total of 6.
For the third stage the possible paths are 
, 
, 
, 
, and 
. That is a total of 5.
However, we cannot jump from 
(this eliminates 5 paths) or 
(this eliminates 6 paths), so we must subtract 
.
The answer is 
Solution 3
Another way would be to use a table representing the number of ways to reach a certain number
How we came with each value is to just add in the number of ways that we can reach that number from previous numbers. For example, for 
, we can reach it from 
, so we add all those values to get the value for . For 
, it is only reachable from 
or , so we have 
.
The answer for 
can be computed in a similar way to get 
.
See also
| 2007 AIME I (Problems • Answer Key • Resources) | ||
| Preceded by Problem 5 |
Followed by Problem 7 | |
| 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. 
