Skip to content
NCERT Exemplar · Q33

Q.If 251525^{15} is divided by 1313, the remainder is ______ .

Puducherry CbseShort· 2mImportance★★★★★est
89% · 57/64 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The remainder when 251525^{15} is divided by 1313 is found by reducing the base modulo 1313 and then applying the Binomial Theorem or Fermat’s Little Theorem. The final remainder is 12\boxed{12}.

The key insight is that when dealing with large powers and remainders, we never actually compute the full number. Instead, we reduce the base modulo the divisor first. Since 25÷1325 \div 13 leaves remainder 1212, we have 25≡12(mod13)25 \equiv 12 \pmod{13}. So the problem becomes: find the remainder when 121512^{15} is divided by 1313.

Now, 1212 is just 13−113 - 1. That’s a gift — because powers of (13−1)(13 - 1) expand beautifully using the Binomial Theorem. Every term except the last will be a multiple of 1313, so the remainder comes only from the final term.

Let’s work through it step by step.

  1. Reduce the base modulo 13

    25=13×1+1225 = 13 \times 1 + 12, so 25≡12(mod13)25 \equiv 12 \pmod{13}.

    Therefore, 2515≡1215(mod13)25^{15} \equiv 12^{15} \pmod{13}.

  2. Rewrite 12 as 13−113 - 1

    1215=(13−1)1512^{15} = (13 - 1)^{15}.

    This is perfect for the Binomial Theorem.

  3. Apply the Binomial Theorem

(13−1)15=∑k=015(15k)1315−k(−1)k(13 - 1)^{15} = \sum_{k=0}^{15} \binom{15}{k} 13^{15-k} (-1)^k

The first term (k=0k=0) is 131513^{15}, which is clearly divisible by 1313.

Every term where k<15k < 15 contains a factor of 1313 (since 1315−k13^{15-k} is present for k≤14k \le 14).

The only term without a factor of 1313 is the last term, k=15k = 15:

(1515)130(−1)15=1⋅1⋅(−1)=−1\binom{15}{15} 13^{0} (-1)^{15} = 1 \cdot 1 \cdot (-1) = -1

  1. Interpret the result modulo 13 So (13−1)15=(multiple of 13)−1(13 - 1)^{15} = (\text{multiple of }13) - 1. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.