Let be a strictly increasing sequence of positive integers such that What is the remainder when is divided by ?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
A number and its cube always leave the same remainder when divided by 6, so the sum of cubes acts like the plain sum.
Solution
We cannot possibly find the numbers, so the answer must depend only on their sum. Look for a link between a number and its cube when dividing by .
- Try small numbers.
| remainder of when divided by |
Each cube leaves the same remainder as the number itself.
2. Why it is always true. The difference is
the product of three numbers in a row. Among three numbers in a row, one is even and one is a multiple of . So the product is a multiple of . That means and always leave the same remainder when divided by .
3. Add them up. Since each cube differs from its number by a multiple of , the sum of the cubes differs from the plain sum by a multiple of . So the sum of cubes has the same remainder as
4. Remainder of . , so only the matters. Powers of divided by :
- , , , , , ...
Odd powers leave and even powers leave . The power is even, so the remainder is .
The answer is .
Why this works
When a problem gives far too little information to find the numbers, it is asking about something that does not depend on them. Here that is the fact that a number and its cube always leave the same remainder when divided by . The words "strictly increasing" do not matter at all.
Alternative approach
Find the remainder of by thinking about and separately. It is even, so its remainder when divided by is . Also is one less than a multiple of , and an even power of such a number is one more than a multiple of . Among , the only number that is even and one more than a multiple of is .
The trap
Trying to find the actual numbers (they cannot be found), or thinking 2 to a power always leaves remainder 2 when divided by 6; even powers leave 4.
Concise solution
The sequence itself is nowhere near determined, so the answer must depend only on the given sum. The bridge between a number and its cube modulo is the identity
a product of three consecutive integers, which always contains a multiple of and a multiple of . Hence for every integer .
Applying this to each term and adding,
Now , so . Powers of modulo go : odd exponents give , even exponents give . Since is even, .
The answer is .
Review in the AoPS books
- Introduction to Number Theory, Chapter 12: Introduction to Modular Arithmetic
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Introduction to Algebra, Chapter 11: Special Factorizations
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.1)
Techniques
Apply an identity: SFFT, sum of squares, difference of cubes, Vieta · Compute small cases, spot the pattern, generalize