IPMAT Indore 2025 · Quantitative Ability · Question 40

IPMAT Indore 2025 previous year question on Remainder Theorem, with the answer and a step-by-step solution.

Remainder TheoremNumber SystemMultiple choiceMedium
The remainder when {11}^{1011}+{1011}^{11} is divided by 9 is
  1. A
    0
  2. B
    8
  3. C
    9
  4. D
    7
Pick an option, then check.
Answer & solution

Answer: Option B

Handle the two pieces separately, then add the remainders.

Step 1 — reduce the first term’s base.

11\equiv 2 (\mod 9) \Rightarrow{11}^{1011}\equiv{2}^{1011}(\mod 9)

Step 2 — find the cycle of powers of 2 mod 9.

{2}^{1}\equiv 2,{2}^{2}\equiv 4,{2}^{3}\equiv 8,{2}^{4}\equiv 7,{2}^{5}\equiv 5,{2}^{6}\equiv 1 (\mod 9)

The pattern repeats every 6 steps.

1011=6\times 168+3 \Rightarrow{2}^{1011}\equiv{2}^{3}\equiv 8 (\mod 9)

Step 3 — the second term. Use the digit-sum test for 9: 1+0+1+1=3, so

1011\equiv 3 (\mod 9) \Rightarrow{1011}^{11}\equiv{3}^{11}(\mod 9)

But {3}^{2}=9\equiv 0, and 11\ge 2, so {3}^{11} is a multiple of 9:

{1011}^{11}\equiv 0 (\mod 9)

Step 4 — combine.

{11}^{1011}+{1011}^{11}\equiv 8+0=8 (\mod 9)

Answer: Option 2 — 8

More Remainder Theorem questions

All Remainder Theorem PYQs →

Take this paper as a timed test
Real exam timing, instant score, rank and topic-wise analysis.

Practice timed →