Maths Olympiad Prep

Library / /30 of 45

, 2008

Algebra Difficulty 5.9 AIME, harder Prove it Slovenia

The terms a1,a2,a3,a4,a5a_1, a_2, a_3, a_4, a_5 of a geometric sequence are positive integers. All are less than 20082008, a2a_2 is divisible by 55, a3a_3 is divisible by 44, a4a_4 is divisible by 33, a1a_1 is not divisible by 66 and no prime number divides all five of them. Determine the terms of this sequence.

Solution

Since a1,a2,a3,a4,a5a_1, a_2, a_3, a_4, a_5 are terms of a geometric sequence, we can write ai=a1qi1a_i = a_1 \cdot q^{i-1} for i=2,3,4,5i = 2, 3, 4, 5 and for some real number qq. But q=a2a1q = \frac{a_2}{a_1} is a quotient of two positive integers, so qq is rational. Write q=mnq = \frac{m}{n} as a reduced fraction. The terms of the sequence are
a1,a1mn,a1m2n2,a1m3n3,a1m4n4. a_1, \frac{a_1 \cdot m}{n}, \frac{a_1 \cdot m^2}{n^2}, \frac{a_1 \cdot m^3}{n^3}, \frac{a_1 \cdot m^4}{n^4}.
Since all terms are positive integers and mm and nn are relatively prime, we see that n4n^4 is a divisor of a1a_1. So, we can write a1=dn4a_1 = dn^4, where dd is some positive integer. Therefore, the terms of the sequence are
dn4,dmn3,dm2n2,dm3n,dm4. dn^4, dmn^3, dm^2n^2, dm^3n, dm^4.
But since no prime number divides all five of these terms, we have d=1d = 1, and the sequence becomes n4,mn3,m2n2,m3n,m4n^4, mn^3, m^2n^2, m^3n, m^4. We also know that the terms are all less than 20082008, so m4<2008m^4 < 2008 and n4<2008n^4 < 2008. This implies m6m \le 6 and n6n \le 6. But a1=n4a_1 = n^4 is not divisible by 66, so n5n \le 5. We also know that a2=n3ma_2 = n^3m is divisible by 55, a3=n2m2a_3 = n^2m^2 is divisible by 44 and a4=m3na_4 = m^3n is divisible by 33, so the product mnmn is divisible by 22, 33 and 55, i.e. by 3030. At the same time mn65=30mn \le 6 \cdot 5 = 30, so this product is equal to 3030. This implies m=6m = 6 and n=5n = 5. The terms of the sequence are 54=6255^4 = 625, 536=7505^3 \cdot 6 = 750, 5262=9005^2 \cdot 6^2 = 900, 563=10805 \cdot 6^3 = 1080 and 64=12966^4 = 1296.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.