2021 AMC Fall 10B Problem 22
For each integer , let be the sum of all products , where and are integers and . What is the sum of the 10 least values of such that is divisible by ?
Show solution without answering
Key insight
Squaring 1 + 2 + ... + n gives each product twice, leading to a formula with 24 on the bottom. So the top needs a factor of 9.
Solution
Small case first. For the products are , , , so . Now square the sum :
Squaring the sum gives each square once and each product twice. That is the key to a formula.
1. Formula. In general,
Using and , then pulling out the common factor :
Check with : . Good.
2. When is a multiple of 3? The bottom is . For to still have a factor of after dividing, the top needs two factors of , that is, it must be a multiple of .
3. Where can the factors of 3 come from? Not from : it always leaves remainder when divided by . So must be a multiple of . Among three numbers in a row, exactly one is a multiple of , so that one must be a multiple of .
4. So one of , , is a multiple of . In other words, is one less than a multiple of , a multiple of , or one more than a multiple of . Listing from the smallest ( starts at ):
5. Add them. Each group of three adds to three times its middle number: .
The answer is .
Why this works
"Add up all products of two different numbers from a list" always equals (sum squared minus sum of squares) divided by . After that, the problem is about factors of . The subtle point is that a on the bottom of the fraction raises the bar: the top needs a factor of , not just .
Alternative approach
Build one step at a time and track only the remainder when dividing by . Going from to adds the new products , which total .
| 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2 | 11 | 35 | 85 | 175 | 322 | 546 | 870 | 1320 | 1925 | 2717 | 3731 | |
| remainder | 2 | 2 | 2 | 1 | 1 | 1 | 0 | 0 | 0 | 2 | 2 | 2 |
The remainders repeat every steps, with at , then , and so on. This matches the list above.
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Expanding gives every once and every product with twice, so
Factor out inside the bracket: , and . Hence
Since , is divisible by exactly when the numerator is divisible by . The factor is never a multiple of , so we need . At most one of three consecutive integers is a multiple of , so one of them must be a multiple of : or .
The ten smallest such are , with sum
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Introduction to Algebra, Chapter 21: Sequences & Series (§21.1, §21.2, §21.3, §21.4)
- Introduction to Algebra, Chapter 11: Special Factorizations (§11.2, §11.3, §11.5)
- Introduction to Number Theory, Chapter 10: Units Digits
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.