Start Learning Free

Before You Begin

Question #40635

Difficulty: 8/10 | 🟢 Free

The Question

Let MnM_n be the greatest binomial coefficient in the expansion of (1+x)2n(1+x)^{2n}. Which of the following inequalities holds strictly true for all integers n≥1n \ge 1?

Options

  • A.

    16nπ(n+1)<Mn2<16nπ(n+12)\frac{16^n}{\pi(n+1)} < M_n^2 < \frac{16^n}{\pi(n+\frac{1}{2})}

  • B.

    16nπ(n+12)<Mn2<16nπn\frac{16^n}{\pi(n+\frac{1}{2})} < M_n^2 < \frac{16^n}{\pi n}

  • C.

    16nπn<Mn2<16nπ(n−12)\frac{16^n}{\pi n} < M_n^2 < \frac{16^n}{\pi(n-\frac{1}{2})}

  • D.

    16nπ(n+14)<Mn2<16nπ(n−14)\frac{16^n}{\pi(n+\frac{1}{4})} < M_n^2 < \frac{16^n}{\pi(n-\frac{1}{4})}

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Monster

Ultra-high difficulty questions designed to test your limit, stamina, and deep conceptual understanding.

Concepts Behind This Question

Greatest Binomial Coefficient|Wallis' Formula|Inequalities in Definite Integrals

Why This Question Is Tricky

Common Mistakes

This problem tests the student's ability to bridge discrete combinatorics with continuous calculus.

A common trap is relying on Stirling's approximation (n!∼2πn(n/e)nn! \sim \sqrt{2\pi n}(n/e)^n), which correctly identifies the asymptotic behavior Mn∼4n/πnM_n \sim 4^n/\sqrt{\pi n} but fails to establish rigorous, strict bounds for finite nn.

To bypass this, the student must construct a continuous analog using the Beta function B(k+1,k+1)=∫01(x(1−x))kdxB(k+1, k+1) = \int_0^1 (x(1-x))^k dx.

By evaluating this integral for integer and half-integer values, and applying algebraic inequalities to the integrand x(1−x)≤1/4x(1-x) \le 1/4, the discrete binomial coefficient is rigorously bounded.

This highlights the JEE Advanced theme of using definite integral inequalities to bound discrete sums or coefficients.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterBinomial Theorem - Class 11
ConceptGreatest Binomial Coefficient
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree