Start Learning Free

Before You Begin

Question #41278

Difficulty: 8/10 | 🟢 Free

The Question

Consider the system of linear equations: x+y+z=1x + y + z = 1 2x+3y+[α]z=22x + 3y + [\alpha]z = 2 8x+6y+3∣α∣z=β8x + 6y + 3|\alpha|z = \beta where α,β∈R\alpha, \beta \in \mathbb{R} and [t][t] denotes the greatest integer less than or equal to tt. Let AA be the set of all values of α\alpha for which there exists a real number β\beta such that the system has infinitely many solutions. If S=∑α∈A∣α∣S = \sum_{\alpha \in A} |\alpha| and β0\beta_0 is the unique value of β\beta that makes the system consistent for these α\alpha, then the value of 3S+β03S + \beta_0 is:

Options

  • A.

    130

  • B.

    52

  • C.

    122

  • D.

    138

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

Cramer's Rule Constraints|Line-Plane intersection logic|Greatest Integer Function (GIF)|Modulus Sign Dependency

Why This Question Is Tricky

Common Mistakes

This question tests the student's ability to analyze a system of linear equations where the coefficients are non-differentiable, piecewise functions (Greatest Integer Function and Modulus).

The primary trap is assuming the modulus and GIF behave uniformly, leading students to either miss the negative roots entirely or miscalculate the bounds of the GIF inequality.

By forcing Δ=0\Delta = 0 into a piecewise Diophantine-like inequality n≤f(n)<n+1n \le f(n) < n+1, it rigorously filters out students who rely on purely symbolic determinant expansion without analyzing the domain of α\alpha.

The secondary trap lies in the intersection logic: realizing that Δz=0\Delta_z = 0 uniquely determines β0\beta_0 independent of α\alpha, preventing a false assumption that β\beta varies with each root.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterDeterminants - Class 12
ConceptCramer's Rule Constraints
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree