2024 AMC 10A Problem 19
The first three terms of a geometric sequence are the integers and , where . What is the sum of the digits of the least possible value of ?
Show solution without answering
Key insight
The middle term squared equals the product of the outer terms, so ab = 720². Make a the largest divisor of 720² below 720.
Solution
1. Use the geometric-sequence rule. In , the ratio is the same each step: . Cross-multiplying gives
2. Turn the question around. . To make as small as possible, make as large as possible, while keeping below and a whole number. So we want the largest divisor of that is less than .
3. What do divisors of look like? , so . A divisor can only use the primes , , : at most eight s, four s and two s.
4. Search just below , sorted by how many s are used.
- Two s: , where uses only s and s. To be just below , should be just below . The numbers made of s and s near there are , , . So gives .
- One : with just below . Numbers made of s and s near there: , , . gives itself (not allowed), so the best is .
- No s: numbers made of s and s near are and . The best below is .
The largest is .
5. Find . . Check: and . The sequence works.
6. The digits of add to .
The answer is .
Why this works
In any geometric sequence of three terms, the middle term squared equals the product of the outer two. That turns "smallest " into "largest ", and must be a divisor of , so it can only be built from the primes , and . The ratio does not need to be a whole number; here it is .
Alternative approach
Think about the ratio instead. Write the ratio as a fraction in lowest terms. Then is a whole number only if divides , and is a whole number only if divides . So we want two divisors of whose ratio is as close to as possible (but bigger than ). The divisors of near the middle include and . The ratios , and are candidates, and is the smallest. So .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let the common ratio be , and write in lowest terms. Then is an integer only if (since ), and is an integer only if . Conversely any coprime divisors of give a valid sequence.
Since , we want the smallest ratio between two divisors of . The divisors in order are
The smallest ratio of consecutive divisors is (compare , , again; every other consecutive ratio is larger). So , and
Check: has ratio throughout. The digit sum of is .
The answer is .
Review in the AoPS books
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Introduction to Number Theory, Chapter 1: Integers: The Basics (§1.4, §1.5)
- Introduction to Algebra, Chapter 11: Special Factorizations
- Intermediate Algebra, Chapter 17: More Sequences and Series (§17.1, §17.2)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.