Q.The maximum value of is .
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The determinant simplifies to , whose maximum value is , achieved when (or ).
The problem asks for the maximum value of a determinant that depends on . At first glance, it looks messy — but the structure is actually quite neat. The matrix has many 1’s, with only two entries that vary: the entry is and the entry is . This pattern suggests that subtracting rows or columns will create zeros and simplify the determinant dramatically.
The key insight: when a matrix has many repeated entries, row/column operations can reduce it to a much simpler form without changing the determinant’s value. Here, subtracting the first row from the second and third rows will turn most of the matrix into zeros, leaving only a tiny determinant to evaluate.
Let’s work through it step by step.
- Write the determinant
- Simplify using row operations Subtract the first row from the second row () and from the third row (). This does not change the determinant’s value.
Why does this work? Because subtracting a multiple of one row from another leaves the determinant unchanged. The first row stays intact; the second row becomes , and the third becomes .
- Evaluate the triangular determinant The matrix is now upper triangular (all entries below the main diagonal are zero). The determinant of a triangular matrix is simply the product of its diagonal entries. …
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.