Skip to main content
Back to Matrices & Determinants
JEE Main 2020
Matrices & Determinants
Matrices and Determinants
Easy

Question

Let M = \left\{ {A = \left( {\matrix{ a & b \cr c & d \cr } } \right):a,b,c,d \in \{ \pm 3, \pm 2, \pm 1,0\} } \right\}. Define f : M \to Z, as f(A) = det(A), for all A\inM, where z is set of all integers. Then the number of A\inM such that f(A) = 15 is equal to _____________.

Answer: 15

Solution

Key Concept: Determinant of a 2×22 \times 2 Matrix For a 2×22 \times 2 matrix A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix}, its determinant, denoted as det(A)\det(A) or A|A|, is calculated using the formula: det(A)=adbc\det(A) = ad - bc This formula represents the difference between the product of the main diagonal elements (aa and dd) and the product of the anti-diagonal elements (bb and cc).

Understanding the Problem We are given a set MM of 2×22 \times 2 matrices where each entry a,b,c,da, b, c, d must belong to the specific finite set S={±3,±2,±1,0}S = \{ \pm 3, \pm 2, \pm 1, 0 \}. We need to find the number of matrices AMA \in M such that f(A)=det(A)=15f(A) = \det(A) = 15. This means we are looking for the total count of distinct ordered quadruplets (a,b,c,d)(a, b, c, d) such that a,b,c,dSa, b, c, d \in S and their determinant adbc=15ad - bc = 15.

Step 1: Determine the Possible Values for Products adad and bcbc

The elements a,b,c,da, b, c, d are chosen from the set S={3,2,1,0,1,2,3}S = \{-3, -2, -1, 0, 1, 2, 3\}. Let X=adX = ad and Y=bcY = bc. Our goal is to find the number of ways to choose a,b,c,da,b,c,d such that XY=15X - Y = 15.

First, let's find all possible product values for any two elements from SS:

  • If either element is 00, the product is 00.
  • If both elements are non-zero, the possible products are:
    • 1×1=11 \times 1 = 1, 1×(1)=11 \times (-1) = -1
    • 1×2=21 \times 2 = 2, 1×(2)=21 \times (-2) = -2
    • 1×3=31 \times 3 = 3, 1×(3)=31 \times (-3) = -3
    • 2×2=42 \times 2 = 4, 2×(2)=42 \times (-2) = -4
    • 2×3=62 \times 3 = 6, 2×(3)=62 \times (-3) = -6
    • 3×3=93 \times 3 = 9, 3×(3)=93 \times (-3) = -9 (Products of two negative numbers yield positive results, e.g., (1)×(2)=2(-1) \times (-2) = 2, which are already covered by positive products.) So, the set of all possible product values for adad or bcbc is P={0,±1,±2,±3,±4,±6,±9}P = \{0, \pm 1, \pm 2, \pm 3, \pm 4, \pm 6, \pm 9\}.

Important Constraint Check: Consider the equation adbc=15ad - bc = 15:

  • If ad=0ad = 0, then 0bc=15    bc=150 - bc = 15 \implies bc = -15. However, 15-15 is not in the set of possible product values PP (the minimum product is 9-9). Therefore, adad cannot be 00. This implies that a0a \ne 0 and d0d \ne 0.
  • If bc=0bc = 0, then ad0=15    ad=15ad - 0 = 15 \implies ad = 15. However, 1515 is not in PP (the maximum product is 99). Therefore, bcbc cannot be 00. This implies that b0b \ne 0 and c0c \ne 0.

This critical observation simplifies our problem: all four entries a,b,c,da, b, c, d must be non-zero. They must be chosen from the set S={±1,±2,±3}S' = \{\pm 1, \pm 2, \pm 3\}.

Step 2: Enumerate Ways to Form Products from SS' Now, let's count the number of distinct ordered pairs (x,y)(x,y) from SS' such that their product xyxy equals a specific value. This is crucial for correctly counting the matrices.

  • xy=1xy = 1: (1,1),(1,1)(1,1), (-1,-1) (2 ways)
  • xy=1xy = -1: (1,1),(1,1)(1,-1), (-1,1) (2 ways)
  • xy=2xy = 2: (1,2),(2,1),(1,2),(2,1)(1,2), (2,1), (-1,-2), (-2,-1) (4 ways)
  • xy=2xy = -2: (1,2),(2,1),(1,2),(2,1)(1,-2), (-2,1), (-1,2), (2,-1) (4 ways)
  • xy=3xy = 3: (1,3),(3,1),(1,3),(3,1)(1,3), (3,1), (-1,-3), (-3,-1) (4 ways)
  • xy=3xy = -3: (1,3),(3,1),(1,3),(3,1)(1,-3), (-3,1), (-1,3), (3,-1) (4 ways)
  • xy=4xy = 4: (2,2),(2,2)(2,2), (-2,-2) (2 ways)
  • xy=4xy = -4: (2,2),(2,2)(2,-2), (-2,2) (2 ways)
  • xy=6xy = 6: (2,3),(3,2),(2,3),(3,2)(2,3), (3,2), (-2,-3), (-3,-2) (4 ways)
  • xy=6xy = -6: (2,3),(3,2),(2,3),(3,2)(2,-3), (-3,2), (-2,3), (3,-2) (4 ways)
  • xy=9xy = 9: (3,3),(3,3)(3,3), (-3,-3) (2 ways)
  • xy=9xy = -9: (3,3),(3,3)(3,-3), (-3,3) (2 ways)

Step 3: Find Pairs (ad,bc)(ad, bc) such that adbc=15ad - bc = 15 We need to find pairs of product values (X,Y)(X, Y) from P{0}P \setminus \{0\} (as 00 is already excluded) such that XY=15X - Y = 15. The maximum possible value for X=adX=ad is 3×3=93 \times 3 = 9. The minimum possible value for Y=bcY=bc is 3×(3)=93 \times (-3) = -9. Therefore, the maximum possible value for XYX-Y is 9(9)=189 - (-9) = 18. The minimum possible value for XYX-Y is 99=18-9 - 9 = -18. Since 1515 is within this range [18,18][-18, 18], solutions are possible.

Let's systematically check values for X=adX=ad, starting from the maximum possible product:

  • Case 1: X=ad=9X = ad = 9 If ad=9ad=9, then 9Y=15    Y=69 - Y = 15 \implies Y = -6. Both X=9X=9 and Y=6Y=-6 are valid product values in PP.

    • From Step 2, the number of ways to obtain ad=9ad=9 is 2.
    • From Step 2, the number of ways to obtain bc=6bc=-6 is 4. Since the choices for (a,d)(a,d) and (b,c)(b,c) are independent, the number of matrices for this case is the product of the ways: 2×4=82 \times 4 = 8.
  • Case 2: X=ad=6X = ad = 6 If ad=6ad=6, then 6Y=15    Y=96 - Y = 15 \implies Y = -9. Both X=6X=6 and Y=9Y=-9 are valid product values in PP.

    • From Step 2, the number of ways to obtain ad=6ad=6 is 4.
    • From Step 2, the number of ways to obtain bc=9bc=-9 is 2. The number of matrices for this case is 4×2=84 \times 2 = 8.
  • Case 3: X=ad=4X = ad = 4 If ad=4ad=4, then 4Y=15    Y=114 - Y = 15 \implies Y = -11. However, 11-11 is not a possible product value in PP. Thus, there are no matrices for this case.

  • Cases with X3X \le 3 (e.g., ad=3,2,1ad=3, 2, 1) If ad=3ad=3, then 3Y=15    Y=123 - Y = 15 \implies Y = -12. Not in PP. If ad=2ad=2, then 2Y=15    Y=132 - Y = 15 \implies Y = -13. Not in PP. If ad=1ad=1, then 1Y=15    Y=141 - Y = 15 \implies Y = -14. Not in PP. Any smaller positive value for adad will also result in bcbc being an impossible product.

  • Cases with X<0X < 0 (e.g., ad=1,2,,9ad=-1, -2, \dots, -9) If adad is negative, bcbc would need to be an even smaller negative number (e.g., if ad=1,bc=16ad=-1, bc=-16; if ad=9,bc=24ad=-9, bc=-24). None of these very negative values for bcbc are possible products in PP. Thus, there are no matrices for these cases.

Step 4: Total Number of Matrices The total number of matrices AMA \in M such that f(A)=15f(A) = 15 is the sum of the counts from all valid cases. Total matrices = (Matrices from Case 1) + (Matrices from Case 2) Total matrices = 8+8=168 + 8 = 16.

Tips and Key Takeaways

  • Systematic Decomposition: Break down complex counting problems into simpler parts. First, identify the range of possible values for intermediate products (ad,bcad, bc). Second, find pairs of these intermediate products that satisfy the main condition (adbc=15ad-bc=15). Third, count the ways to form each product independently.
  • Ordered Pairs Matter: Remember that for matrix elements, (a,d)(a,d) is distinct from (d,a)(d,a) unless a=da=d. Similarly, (b,c)(b,c) is distinct from (c,b)(c,b). Our counting in Step 2 accounts for these ordered pairs.
  • Implicit Constraints: Always check for implicit constraints. Here, the condition adbc=15ad-bc=15 implicitly meant that none of a,b,c,da,b,c,d could be zero, which significantly narrowed down the choices.
  • Double-Check Range: Ensure that the target value (15 in this case) falls within the possible range of the expression (adbcad-bc) to avoid unnecessary calculations.

The final answer is 16\boxed{\text{16}}.

Practice More Matrices & Determinants Questions

View All Questions