A triangular array of coins has coin in the first row, coins in the second row, coins in the third row, and so on up to coins in the th row. What is the sum of the digits of ?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
The rows add up to N(N+1)/2 coins, so N times (N+1) is 4032. Since 63 squared is close to 4032, try 63 times 64, which is exactly 4032.
Solution
1. The rows hold coins. The total equals . (For example, .)
2. So
3. and are next to each other, so their product is close to . That means is close to the square root of .
4. Try nearby squares: is too small, is a bit too big. Test . It matches exactly, so .
5. The question asks for the sum of the digits of : .
The answer is .
Why this works
"One more in each row" always adds up to a triangular number . A product of two neighboring numbers sits just above , so a square-root estimate finds without solving a quadratic. Read the last line of the question carefully: it asks for a digit sum, not .
The trap
Answering with N itself (63) instead of the sum of its digits, or choosing the wrong N from a rough square root estimate.
Concise solution
The total number of coins is , so
Since is a product of consecutive integers, is just below . As and , try : indeed .
The sum of the digits 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)
- Intermediate Algebra, Chapter 17: More Sequences and Series (§17.1, §17.2)
Techniques
Bound the quantity above/below or estimate to pin it down · Set up the equation/formula and compute; no special trick needed