Define a sequence recursively by , , and the remainder when is divided by 3, for all . Thus the sequence starts . What is ?
Answer Choices
Correct answer marked belowSee the full step-by-step explanation
You can see the correct answer above. Sign in for free to unlock the complete worked solution.
Track your performance and improve
Get detailed analytics, unlock full explanations, and move up difficulty tiers as you practice.
Unlock the full explanation
Create a free account to reveal the correct answer, see the step-by-step explanation, and start tracking your GMAT progress.
For anyone stuck, don't try to list terms forever. The remainders mod 3 repeat in a cycle. Find the period, then add one full cycle's sum and multiply.
This saved me. I was about to write out 100 terms lol.
Yes, and the cycle length is 8, so the sum of any 8 consecutive terms is constant. Then 2017 mod 8 tells you where you start.
The sequence starts 0,1,1,2,0,2,2,1,... I noticed the sum of the first 8 is 9. Since 2024-2017+1=8, does that mean the answer is just 9? Feels too easy for 655-705.
Careful: the sum of any 8 consecutive terms is the same *if* the period is 8. It is, but you should verify the cycle repeats before assuming.
Why is the answer not 8? I got 8 because I summed 0+1+1+2+0+2+2+1=9? Wait, I think I misadded. Let me recheck.
Took me a minute to realize 2017 is not a multiple of the period. I initially thought the sum would be from the start of the cycle. 2017 mod 8 = 1, so the block starts at the second term. Still same sum though because it's a full cycle.
Exactly. Any 8 consecutive terms in a periodic sequence of period 8 will have the same sum as one full period, as long as you take exactly 8 terms.
What it tests
Your ability to spot and extend arithmetic and geometric sequences and work with recursive definitions.
Common trap
Off-by-one errors in indexing (a₀ vs a₁) or confusing an arithmetic difference with a geometric ratio.