Start Learning Free

Before You Begin

Question #41040

Difficulty: 8/10 | 🟢 Free

The Question

Let LL be the horizontal asymptote of the curve y=3000t3+2t2−7t3−t+4y = \frac{3000t^3 + 2t^2 - 7}{t^3 - t + 4} as t→∞t \to \infty. Two boxes contain mathematical expressions. Box I contains the expression (x2+1x)15\left(x^2 + \frac{1}{x}\right)^{15} and Box II contains the expression (x3−2x2)10\left(x^3 - \frac{2}{x^2}\right)^{10}. A fair coin is tossed. If it shows heads, Box I is selected; if tails, Box II is selected. Then, an integer rr is chosen at random from the set S={0,1,2,…,30}S = \{0, 1, 2, \dots, 30\}. What is the probability that the coefficient of xrx^r in the expression of the selected box is strictly greater than LL?

Options

  • A.

    431\frac{4}{31}

  • B.

    962\frac{9}{62}

  • C.

    531\frac{5}{31}

  • D.

    2762\frac{27}{62}

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Bridge

Practice problems that bridge the gap between foundational theory and advanced practical application.

Concepts Behind This Question

Multiplication Theorem|Coefficient of x^r in Expansion|The Empty Set Trap|Rational Function Asymptotes

Why This Question Is Tricky

Common Mistakes

This question tests the Multiplication Theorem of probability intertwined with binomial expansion coefficients.

The primary trap is the 'Empty Set Trap': students often assume that for any integer r within the minimum and maximum possible degrees, a non-zero coefficient exists.

They might erroneously treat the degree equation (e.g., 30-3k = r) as continuous and count all integers r in that interval, failing to realize that r must be generated strictly by an integer k.

A secondary trap involves ignoring the boundary condition r ∈ S, specifically missing that r = -10 for Box II falls outside the sample space, or incorrectly including negative coefficients by taking the absolute value.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 11
ConceptMultiplication Theorem
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree