2007 AIME I Problems/Problem 6

Revision as of 09:28, 15 March 2007 by Calc rulz (talk | contribs) (See also)

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, 0, 3, 6, 13, 15, 26, 39 is a move sequence. How many move sequences are possible for the frog?

Solution

See also

2007 AIME I (ProblemsAnswer KeyResources)
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
Invalid username
Login to AoPS