JEE Challenger
More from Binomial Theorem

Determine Parameter in Binomial Expansion Coefficient Relation

Suppose mm represents the smallest positive integer such that the coefficient of x2x^2 in the algebraic expansion of (1+x)2+(1+x)3+⋯+(1+x)49+(1+mx)50(1+x)^2 + (1+x)^3 + \dots + (1+x)^{49} + (1+mx)^{50} is given by (3n+1) 51C3(3n + 1) \, ^{51}C_3 for some positive integer nn. Find the value of nn.

Official Numerical Answer5

Step-by-Step Solution

To find the value of nn, we first determine the coefficient of x2x^2 in the given algebraic expansion: S=(1+x)2+(1+x)3+⋯+(1+x)49+(1+mx)50S = (1+x)^2 + (1+x)^3 + \dots + (1+x)^{49} + (1+mx)^{50}

The coefficient of x2x^2 in (1+x)k(1+x)^k is given by (k2)\binom{k}{2}. Thus, the coefficient of x2x^2 in the first part of the expression is: ∑k=249(k2)\sum_{k=2}^{49} \binom{k}{2}

Using the Hockey-stick identity, ∑k=rn(kr)=(n+1r+1)\sum_{k=r}^{n} \binom{k}{r} = \binom{n+1}{r+1}, we get: ∑k=249(k2)=(503)\sum_{k=2}^{49} \binom{k}{2} = \binom{50}{3}

The coefficient of x2x^2 in (1+mx)50(1+mx)^{50} is: (502)m2\binom{50}{2} m^2

Therefore, the total coefficient of x2x^2 in SS is: C=(503)+m2(502)C = \binom{50}{3} + m^2 \binom{50}{2}

We can express (503)\binom{50}{3} and (502)\binom{50}{2} in terms of (513)\binom{51}{3}: (513)=51×50×493×2×1=17×50×492=17(502)\binom{51}{3} = \frac{51 \times 50 \times 49}{3 \times 2 \times 1} = 17 \times \frac{50 \times 49}{2} = 17 \binom{50}{2}   ⟹  (502)=117(513)\implies \binom{50}{2} = \frac{1}{17} \binom{51}{3}

Using Pascal's Identity (513)=(503)+(502)\binom{51}{3} = \binom{50}{3} + \binom{50}{2}, we have: (503)=(513)−(502)=(1−117)(513)=1617(513)\binom{50}{3} = \binom{51}{3} - \binom{50}{2} = \left(1 - \frac{1}{17}\right) \binom{51}{3} = \frac{16}{17} \binom{51}{3}

Substituting these back into the expression for CC: C=1617(513)+m217(513)=(m2+1617)(513)C = \frac{16}{17} \binom{51}{3} + \frac{m^2}{17} \binom{51}{3} = \left(\frac{m^2 + 16}{17}\right) \binom{51}{3}

We are given that this coefficient is equal to (3n+1)(513)(3n + 1) \binom{51}{3}. Equating the two expressions: m2+1617=3n+1\frac{m^2 + 16}{17} = 3n + 1 m2+16=51n+17m^2 + 16 = 51n + 17 m2−1=51nm^2 - 1 = 51n

For nn to be a positive integer, m2−1m^2 - 1 must be a positive multiple of 51=3×1751 = 3 \times 17. Thus: (m−1)(m+1)≡0(mod51)(m-1)(m+1) \equiv 0 \pmod{51}

This implies that:

  1. m≡±1(mod3)m \equiv \pm 1 \pmod 3
  2. m≡±1(mod17)m \equiv \pm 1 \pmod{17}

Checking the smallest positive integers m>1m > 1 satisfying m≡±1(mod17)m \equiv \pm 1 \pmod{17}:

  • For m=16m = 16: m2−1=162−1=255m^2 - 1 = 16^2 - 1 = 255 Since 255=51×5255 = 51 \times 5, m=16m = 16 makes n=5n = 5, which is a positive integer.

Since m=16m = 16 is the smallest positive integer (m>1m > 1) satisfying the given condition, the corresponding value of nn is: n=162−151=25551=5n = \frac{16^2 - 1}{51} = \frac{255}{51} = 5