AoPSWiki
Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.

1989 AIME Problems/Problem 4

From AoPSWiki

Revision as of 02:07, 18 July 2008 by Minsoens (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

If a<b<c<d<e are consecutive positive integers such that b+c+d is a perfect square and a+b+c+d+e is a perfect cube, what is the smallest possible value of c?

Solution

Since the middle term of an arithmetic progression with an odd number of terms is the average of the series, we know b + c + d = 3c and a + b + c + d + e = 5c. Thus, c must be in the form of 3 \cdot x^2 based upon the first part and in the form of 5^2 \cdot y^3 based upon the second part, with x and y denoting an integers. c is minimized if it’s prime factorization contains only 3,5, and since there is a cubed term in 5^2 \cdot y^3, 3^3 must be a factor of c. 3^35^2 = 675, which works as the solution.

See also

1989 AIME (ProblemsResources)
Preceded by
Problem 3
Followed by
Problem 5
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Try our innovative online adaptive learning system, Alcumus.
Over 1100 problems and 60+ video lessons. FREE!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us