2007 AIME I Problems/Problem 6
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 that 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?
Contents
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 .
 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 .
Regrouping, work from
 There are ways to get to
 Continuing from , there are ways to continue to .
 There are ways to reach .
 Continuing from , there are (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 .
Solution 4
I believe this is an easier way of organizing the solution to reduce the possibility of mistakes. This is a highly visual solution, so it's much easier to record than a tree or table.
Here is my diagram to help you see what I did: https://drive.google.com/file/d/1Gk_cziYvoeguVTap5FGOds3SEfiDAW/view?usp=sharing
Using graph paper, draw a number line from 039.
On one line, dot every multiple of 3.
Then on a line below it, dot every multiple of 13.
This way you can clearly see which goes before or after which.
To make it easier to understand, I'll compare these jumps to a train system. Imagine that every multiple of 3 is a short transit, while the multiples of 13 are long transits; because of the possibility to skip a large section in one move. As we continue, picture each "transit" of 13 to be an option, like a switch. If you are the frog that are riding these trains, you would probably think like this: "I could use the first long transit, skip the second, and use the third. Or, I could skip both first and second and use only the third. etc.) From now on I'll be calling the multiples of 13: 13, 26, and 39, as stations 1, 2, and 3 for clarity.
Thinking like this organizes the problem efficiently into cases, where you could choose which "long transits" to ride. We will start with the harder cases and move downwards. Write out each of the 8 cases to record each one. Once we do the hardest case, which is the first one, every preceding one will be easier with the knowledge we gather.
Case #1: 111
You have 5 locations to choose to jump to station 1. From the start (0), 3, 6, 9, or 12. The same goes for station #2, with 13, 15, 18, 21, or 24. However, station #3 is tricky. You can jump from 26, 27, 30, or 33, but if you jumped from 36, then that could qualify as skipping jumping station #3, because station #3 is both a multiple of 3 and a multiple of 13. For example, if you jumped from 36 as your last move, then those moves are essentially the same as case 110.
So, .
Case #2: 110
Start with what you did on case #1, but when you reach station 2 continue only jumping multiples of 3 to 39.
Case #3: 101
We have the 5 original choices, and when you reach station #1, move to 27 on the number line, slightly ahead of station #2. Here is another tricky part. Since we did not start on station 2 like we did in case #1, there are only 3 cases instead of 4.
Case #4: 100
This one is simple.
Case #5: 011
Jump multiples of 3 to get to 15, where you will have 4 locations to jump to station 2, and another 4 choices to reach station 3.
Case #6: 010
This one is also simple. Once you reach 15 there are only 4 choices.
Case #7: 001
It only gets simpler. You can only jump at 27, 30, or 33.
Case #8: 000
Simple jumps.
You have reached the end! .
jackshi2006
Solution 5 (Recursionish)
Let be the number of ways one can get to starting at position We wish to compute Now it's just a long simplifications until you get to We have
Most of these steps are valid since at any that is a multiple of we can either go to the next multiple of or we can skip to the next multiple of which is simply
From these equations we have deduced Continuing we have
Finally, note that since at any point we can either go to the next multiple of or go to the next multiple of which happens to be Therefore Similarly we find so the end answer is
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.