Join the USAMO Guide Discord Server. Regular updates are posted there!

Let me Join!
Dismiss

Problem 10 (2008 AIME II)

AIME 2008
Community difficultyNo ratings yetBe the first to rate this problem.
Understand the scale
Scale 0.5: Easiest math competition problems, often solvable even for early middle school students without experience. 1: Problems strictly for beginners, often at a moderate middle school level. 1.5: Problems for stronger beginner students, on the level of the middling problems in most middle school contests. 2: For motivated beginners, harder questions from the previous categories. 2.5: More advanced beginner problems, hardest questions from previous categories. 3: Early intermediate problems that require more creative thinking. 3.5: Tougher early intermediate problems that consistently stretch into higher-level creative thinking or conceptual knowledge. 4: Intermediate-level problems. 4.5: Upper intermediate problems approaching the upper bound for non-invitational sprint math competitions. 5: More difficult AIME problems or simple proof-based Olympiad-style problems. 6: High-level AIME-styled questions or introductory Olympiad-level questions. 7: Tougher Olympiad-level questions, may require more technical knowledge. 8: High-level Olympiad-level questions. 9: Expert Olympiad-level questions. 9.5: The hardest problems appearing on Olympiads which the strongest students could reasonably solve. 10: Historically notorious problems, generally unsuitable for even very hard competitions because they are exceedingly tedious, long, and difficult.

Suggest tags for this problem

This problem does not have any tags yet. Add a few useful tags and once enough people agree, they will be added here automatically.

Problem

The diagram below shows a 4×44\times4 rectangular array of points, each of which is 11 unit away from its nearest neighbors. $

figure

Defineagrowingpathtobeasequenceofdistinctpointsofthearraywiththepropertythatthedistancebetweenconsecutivepointsofthesequenceisstrictlyincreasing.Let Define a growing pathto be a sequence of distinct points of the array with the property that the distance between consecutive points of the sequence is strictly increasing. Let m bethemaximumpossiblenumberofpointsinagrowingpath,andletbe the maximum possible number of points in a growing path, and let r bethenumberofgrowingpathsconsistingofexactlybe the number of growing paths consisting of exactly m points.Findpoints. Find mr $ .

← Back to all problems