Start Learning Free

Before You Begin

Question #40692

Difficulty: 8/10 | 🟢 Free

The Question

Let TnT_n be a sequence of distinct real numbers in a Geometric Progression. Let T1=1T_1 = 1 and rr be its common ratio. Define the determinant Δ(r)=∣111T1+T2T2+T3T3+T4T12+T22T22+T32T32+T42∣\Delta(r) = \begin{vmatrix} 1 & 1 & 1 \\ T_1+T_2 & T_2+T_3 & T_3+T_4 \\ T_1^2+T_2^2 & T_2^2+T_3^2 & T_3^2+T_4^2 \end{vmatrix} If Δ(r)≥0\Delta(r) \ge 0, which of the following represents the complete set of valid values for rr?

Options

  • A.

    (−∞,−1)∪(−1,0)∪(1,∞)(-\infty, -1) \cup (-1, 0) \cup (1, \infty)

  • B.

    (−1,0)∪(1,∞)(-1, 0) \cup (1, \infty)

  • C.

    (−∞,0)∪(1,∞)(-\infty, 0) \cup (1, \infty)

  • D.

    (−∞,0]∪[1,∞)(-\infty, 0] \cup [1, \infty)

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

Selection of GP Terms|Factor Theorem in Determinants|Wavy Curve (Method of Intervals)|Polynomial Function Parity

Why This Question Is Tricky

Common Mistakes

This question tests the application of the Factor Theorem in determinants and the Wavy Curve method, specifically targeting two lethal traps.

First, the determinant simplifies to a polynomial with an even power factor (r+1)2(r+1)^2.

Students frequently make sign-inversion errors (Secondary Trap 21) by alternating signs across all roots, incorrectly assuming odd parity for the root r=−1r=-1, which leads to the erroneous exclusion of the interval (−∞,−1)(-\infty, -1).

Second, the problem requires the geometric progression to have distinct terms, acting as a hidden domain restriction that forces the exclusion of r∈{0,1,−1}r \in \{0, 1, -1\}.

Forgetting this degeneracy constraint leads to incorrect inclusion of these boundary points.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterSequences and Series - Class 11
ConceptSelection of GP Terms
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree