AoPSWiki
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.

2001 AIME II Problems/Problem 1

From AoPSWiki

Revision as of 20:59, 30 October 2007 by Azjps (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

Let N be the largest positive integer with the following property: reading from left to right, each pair of consecutive digits of N forms a perfect square. What are the leftmost three digits of N?

Solution

The two-digit perfect squares are 16, 25, 36, 49, 64, 81. We try making a sequence starting with each one:

  • 16 - 64 - 49. This terminates since none of them end in a 9, giving us 1649.
  • 25.
  • 36 - 64 - 49, 3649.
  • 49.
  • 64 - 49, 649.
  • 81 - 16 - 64 - 49, 81649.

The largest is 81649, so our answer is \boxed{816}.

See also

2001 AIME II (ProblemsResources)
Preceded by
First question
Followed by
Problem 2
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us