RankRizz
JEE MAIN 2021 · 25 JUL S2+4MEDIUMTRANSCRIBED

JEE Main 2021 Mathematics question — Sums of binomial coefficients

Let n∈Nn \in \mathbf{N} and [x][x] denote the greatest integer less than or equal to xx. If the sum of (n+1)(n + 1) terms of nC0,3⋅nC1,5⋅nC2,7⋅nC3,…^nC_0, 3 \cdot ^nC_1, 5 \cdot ^nC_2, 7 \cdot ^nC_3, \ldots is equal to 2100⋅1012^{100} \cdot 101, then 2[n−12]2\left[\frac{n-1}{2}\right] is equal to

SOLUTION

We begin with the given series

nC0,  3⋅nC1,  5⋅nC2,  7⋅nC3,  …,  (n+1) terms^nC_0,\; 3\cdot {}^nC_1,\; 5\cdot {}^nC_2,\; 7\cdot {}^nC_3,\; \ldots,\;(n+1)\text{ terms}

Every coefficient in front of the binomial term is an odd number. In fact the kthk^{\text{th}} term (starting with k=0k=0) is

(2k+1)  nCk.(2k+1)\;{}^nC_k.

Therefore the required sum can be written compactly as

S  =  ∑k=0n(2k+1)  nCk.S \;=\; \sum_{k=0}^{n} (2k+1)\;{}^nC_k.

We are told that this sum equals 2100⋅1012^{100}\cdot 101, i.e.

∑k=0n(2k+1)  nCk  =  2100⋅101.−(1)\sum_{k=0}^{n} (2k+1)\;{}^nC_k \;=\; 2^{100}\cdot 101. \quad -(1)

Now let us evaluate the left‐hand side purely algebraically. We separate the part involving kk and the part not involving kk:

∑k=0n(2k+1)  nCk  =  2∑k=0nk  nCk  +  ∑k=0nnCk.\sum_{k=0}^{n} (2k+1)\;{}^nC_k \;=\; 2\sum_{k=0}^{n} k\;{}^nC_k \;+\; \sum_{k=0}^{n} {}^nC_k.

For the two standard binomial sums that appear here, we first state the well-known identities:

• Binomial sum ∑k=0nnCk=2n.\displaystyle\sum_{k=0}^{n} {}^nC_k = 2^n.
• Weighted binomial sum ∑k=0nk  nCk=n 2 n−1.\displaystyle\sum_{k=0}^{n} k\;{}^nC_k = n\,2^{\,n-1}.

Using these, we obtain

∑k=0n(2k+1)  nCk=2(n 2 n−1)  +  2n=n 2 n  +  2 n=(n+1) 2 n.\begin{aligned} \sum_{k=0}^{n} (2k+1)\;{}^nC_k &= 2\Bigl(n\,2^{\,n-1}\Bigr) \;+\; 2^n \\ &= n\,2^{\,n} \;+\; 2^{\,n} \\ &= (n+1)\,2^{\,n}. \\ \end{aligned}

Hence the equation (1) becomes

(n+1) 2 n  =  2100⋅101.−(2)(n+1)\,2^{\,n} \;=\; 2^{100}\cdot 101. \quad -(2)

To compare the two sides, we isolate the odd and even (power-of-two) parts. Every positive integer can be written uniquely as (odd part)×2(power of 2 present).\text{(odd part)}\times 2^{\text{(power of 2 present)}}. Let us denote by v2(m)v_2(m) the exponent of the highest power of 22 dividing mm.

Write n+1=2 r m,n+1 = 2^{\,r}\,m, where mm is odd and r=v2(n+1).r = v_2(n+1). Then the left-hand side of (2) has a total power of two equal to n+r,n + r, and its odd part equals m.m. Comparing with the right-hand side, whose power of two is 100100 and whose odd part is 101,101, we obtain two simultaneous requirements:

{m  =  101,n+r  =  100.\begin{cases} m \;=\; 101,\\[4pt] n + r \;=\; 100. \end{cases}

But since m=101,m=101, we have

n+1=101  2 r.−(3)n+1 = 101\;2^{\,r}. \quad -(3)

Substituting n=101  2 r−1n = 101\;2^{\,r} - 1 into the second requirement n+r=100,n + r = 100, we get

101  2 r−1+r  =  100    ⟹    101  2 r+r  =  101.−(4)101\;2^{\,r} - 1 + r \;=\; 100 \;\;\Longrightarrow\;\; 101\;2^{\,r} + r \;=\; 101. \quad -(4)

Because 2 r≥12^{\,r} \ge 1 and r≥0,r \ge 0, the left-hand side of (4) increases rapidly with r.r. Testing non-negative integers:

• If r=0r = 0 then 101⋅1+0=101,101\cdot 1 + 0 = 101, which satisfies (4).
• If r≥1r \ge 1 then 101  2 r≥202,101\;2^{\,r} \ge 202, so the left-hand side exceeds 101,101, violating (4).

Thus r=0r = 0 is the only admissible value. Feeding this back into (3) yields

n+1=101⋅2 0=101    ⟹    n=100.n+1 = 101\cdot 2^{\,0} = 101 \;\;\Longrightarrow\;\; n = 100.

The quantity asked for in the problem is

2[n−12].2\left[\frac{n-1}{2}\right].

With n=100,n = 100, we have

n−12=100−12=992=49.5.\frac{n-1}{2} = \frac{100 - 1}{2} = \frac{99}{2} = 49.5.

The greatest integer function gives [992]=49.\left[\frac{99}{2}\right] = 49.

Multiplying by 22 we obtain

2×49=98.2 \times 49 = 98.

So, the answer is 9898.

Tagged Sums of binomial coefficients. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicSums of binomial coefficients
TypeNumerical answer