If is divisible by 11, and , 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.
Thanks, I was overcomplicating this with long division. The divisibility rule for 11 makes it pretty quick.
Same here lol. Once you see the alternating sum trick it's like 20 seconds.
Quick q — for the alternating sum rule, do you start from the left or the right? I always mess that up and get the sign flipped.
Doesn't matter as long as you're consistent, you'll just get the negative of the answer.
Either way works, just alternate all the way through.
Is 13,333 - n divisible by 11 the same as saying 13,333 and n have the same remainder mod 11? Still getting used to modular thinking.
Yep exactly — that's the cleanest way to frame it.
Found this one pretty doable for a 505-555. The only trap is forgetting n has to be between 0 and 11, so if you get something like 12 you need to adjust.
What it tests
Your understanding of divisibility rules, least common multiples, and greatest common factors.
Common trap
Forgetting that 1 is not prime and that every integer divides 0.