Start Learning Free

Before You Begin

Question #41095

Difficulty: 8/10 | 🟢 Free

The Question

Let Cr=(20r)C_r = \binom{20}{r} for 0≤r≤200 \le r \le 20. Define a sequence f(k)=∑r=0k(−1)rCrf(k) = \sum_{r=0}^k (-1)^r C_r. Let A=∑k=010∣f(k)∣A = \sum_{k=0}^{10} |f(k)| and B=∑k=010f(k)B = \sum_{k=0}^{10} f(k). The value of A−∣B∣A - |B| is:

Options

  • A.

    218+(189)2^{18} + \binom{18}{9}

  • B.

    219+(189)2^{19} + \binom{18}{9}

  • C.

    218+(199)2^{18} + \binom{19}{9}

  • D.

    219−(189)2^{19} - \binom{18}{9}

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Specialist

Targeted practice for niche, high-difficulty concepts that frequently appear in JEE Advanced exams.

Concepts Behind This Question

Symmetry and Invariance|Properties of Binomial Coefficients|The Modulus Trap

Why This Question Is Tricky

Common Mistakes

This question tests the student's ability to recognize the telescoping nature of alternating binomial sums and carefully handle the 'Modulus Trap'.

Students often attempt to expand the double summation for BB or misapply continuous approximations, failing to realize that f(k)f(k) simplifies to a single binomial coefficient (−1)k(19k)(-1)^k \binom{19}{k}.

The modulus in AA strips the alternating sign, forcing the evaluation of a half-sum of binomial coefficients requiring symmetry (19k)=(1919−k)\binom{19}{k} = \binom{19}{19-k}.

Meanwhile, BB retains the alternating nature, telescoping once more.

A common trap is ignoring the modulus or assuming the alternating sum BB evaluates to zero, which leads directly to the distractor 218+(199)2^{18} + \binom{19}{9}.

Successfully navigating the parity constraints allows for the final elegant simplification via Pascal's identity.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 11
ConceptSymmetry and Invariance
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree