We begin with the given series
nC0,3⋅nC1,5⋅nC2,7⋅nC3,…,(n+1) terms
Every coefficient in front of the binomial term is an odd number. In fact the kth term (starting with k=0) is
(2k+1)nCk.
Therefore the required sum can be written compactly as
S=∑k=0n(2k+1)nCk.
We are told that this sum equals 2100⋅101, i.e.
∑k=0n(2k+1)nCk=2100⋅101.−(1)
Now let us evaluate the left‐hand side purely algebraically. We separate the part involving k and the part not involving k:
∑k=0n(2k+1)nCk=2∑k=0nknCk+∑k=0nnCk.
For the two standard binomial sums that appear here, we first state the well-known identities:
• Binomial sum k=0∑nnCk=2n.
• Weighted binomial sum k=0∑nknCk=n2n−1.
Using these, we obtain
k=0∑n(2k+1)nCk=2(n2n−1)+2n=n2n+2n=(n+1)2n.
Hence the equation (1) becomes
(n+1)2n=2100⋅101.−(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). Let us denote by v2(m) the exponent of the highest power of 2 dividing m.
Write n+1=2rm, where m is odd and r=v2(n+1). Then the left-hand side of (2) has a total power of two equal to n+r, and its odd part equals m. Comparing with the right-hand side, whose power of two is 100 and whose odd part is 101, we obtain two simultaneous requirements:
{m=101,n+r=100.
But since m=101, we have
n+1=1012r.−(3)
Substituting n=1012r−1 into the second requirement n+r=100, we get
1012r−1+r=100⟹1012r+r=101.−(4)
Because 2r≥1 and r≥0, the left-hand side of (4) increases rapidly with r. Testing non-negative integers:
• If r=0 then 101⋅1+0=101, which satisfies (4).
• If r≥1 then 1012r≥202, so the left-hand side exceeds 101, violating (4).
Thus r=0 is the only admissible value. Feeding this back into (3) yields
n+1=101⋅20=101⟹n=100.
The quantity asked for in the problem is
2[2n−1].
With n=100, we have
2n−1=2100−1=299=49.5.
The greatest integer function gives [299]=49.
Multiplying by 2 we obtain
2×49=98.
So, the answer is 98.