PYQ Vault

JEE Mains Maths · Binomial Theorem

Remainders and Divisibility

Using the binomial theorem to find the remainder of a large power: write the base as a multiple of the divisor plus or minus a small number, and keep only the terms the divisor does not swallow.

Why this matters

Twenty-four PYQs, twelve of them numerical answer, and 2023 alone has ten. Twenty-one ask for a remainder or a count of exponents with a given remainder; three ask what an expression is divisible by. Two ideas cover the page.

Concept 1 of 2: Remainders of large powers

Find a power of the base that is close to a multiple of the divisor mm: ak=mq±1a^k=mq\pm1 or mq±cmq\pm c. Then akn=(mq±1)na^{kn}=(mq\pm1)^n, and every term of the expansion except the last contains mm. So the remainder comes from (±1)n(\pm1)^n, times whatever power of aa is left over. Remainders repeat in a cycle, and a combined divisor like 35 splits into 5 and 7.

Definition

  • (mq+c)n≡cn(modm)(mq+c)^n\equiv c^n\pmod m.
  • Look for ak≡±1a^k\equiv\pm1: e.g. 23=8≡1(mod7)2^3=8\equiv1\pmod7, 32=9≡−1(mod10)3^2=9\equiv-1\pmod{10}.
  • A negative remainder −r-r means m−rm-r.
  • (mq+c)n≡cn+n cn−1mq(modm2)(mq+c)^n\equiv c^n+n\,c^{n-1}mq\pmod{m^2}: two terms survive modulo m2m^2.

Base near a multiple

(mq±1)n=m(… )+(±1)n(mq\pm1)^n=m(\dots)+(\pm1)^n

Worked example

Find the remainder when 21002^{100} is divided by 7.
Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

JEE Mains · 2022 · 14 June 2022 · Q62Moderate

Example 1 · Binomial Theorem · Remainders and Divisibility

The remainder when 320223^{2022} is divided by 5 is

Leftover factors

If the exponent is not a multiple of the cycle, a factor remains outside the bracket: 2100=2⋅8332^{100}=2\cdot8^{33}. Forgetting that factor gives remainder 1 instead of 2.

Concept 2 of 2: What an expression is divisible by

an−bna^n-b^n is always divisible by a−ba-b, and by a+ba+b when nn is even. Pair the terms of a four-term expression two ways to find factors. For expressions like 9n−8n−19^n-8n-1, expand (1+8)n(1+8)^n: the first two terms cancel the 8n+18n+1, leaving a multiple of 6464.

Definition

  • (a−b)∣(an−bn)(a-b)\mid(a^n-b^n); (a+b)∣(an−bn)(a+b)\mid(a^n-b^n) for even nn.
  • (1+m)n−mn−1=(n2)m2+(n3)m3+…(1+m)^n-mn-1=\binom n2m^2+\binom n3m^3+\dots, divisible by m2m^2.
  • To show 'not divisible by dd', compute the remainder modulo dd.

Removing the first two terms

(1+m)n−mn−1=m2[(n2)+(n3)m+… ](1+m)^n-mn-1=m^2\left[\binom n2+\binom n3m+\dots\right]

Worked example

Show that 4n−3n−14^n-3n-1 is divisible by 9.
Practice this conceptself-check · 4 quick reps

The same idea in a real exam question:

JEE Mains · 2023 · 8 Apr 2023 · Q163Moderate

Example 2 · Binomial Theorem · Remainders and Divisibility

25190−19190−8190+219025^{190}-19^{190}-8^{190}+2^{190} is divisible by

Pair the terms to match the signs

an−bn−cn+dna^n-b^n-c^n+d^n can be grouped as (an−cn)−(bn−dn)(a^n-c^n)-(b^n-d^n) or (an−bn)−(cn−dn)(a^n-b^n)-(c^n-d^n). Each grouping gives a different common factor; try both.

Summary — formulas & gotchas at a glance

A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.

Formulas (2)

  • Remainders of large powers

    Base near a multiple

    (mq±1)n=m(… )+(±1)n(mq\pm1)^n=m(\dots)+(\pm1)^n
  • What an expression is divisible by

    Removing the first two terms

    (1+m)n−mn−1=m2[(n2)+(n3)m+… ](1+m)^n-mn-1=m^2\left[\binom n2+\binom n3m+\dots\right]

Watch out for (2)

Test yourself on Binomial Theorem

20 past JEE Mains questions from this chapter, timed at 48 minutes and marked the way the exam marks it. You see your score and every answer the moment you finish. Free to start.