RankRizz
JEE MAIN 2010TRANSCRIBED

JEE Main 2010 Mathematics question — Counting matrices with given properties

The number of 3×33 \times 3 non-singular matrices, with four entries as 11 and all other entries as 00, is

SOLUTION

Key idea: Count the non-singular matrices directly, or simply build more than 6 of them.

  1. A non-singular 3×33\times3 0-1 matrix needs a 1 in every row and every column. With four 1s, that means a permutation matrix (three 1s, det⁡=±1\det = \pm1) plus one extra 1.
  2. Example: (110010001)\begin{pmatrix}1&1&0\\0&1&0\\0&0&1\end{pmatrix} has det⁡=1\det = 1. An extra 1 added to the identity in any of the 6 off-diagonal positions gives a triangular-type matrix with det⁡=1\det = 1, so there are already 6 from the identity alone.
  3. Doing the same with the other permutation matrices gives many more. Exactly, there are 6×6=366 \times 6 = 36 placements (permutation, extra position), each giving a distinct non-singular matrix. A full enumeration of all (94)=126\binom94 = 126 matrices confirms 36.
  4. So the number is at least 7.

Answer: (C) at least 7

Tagged Counting matrices with given properties. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCounting matrices with given properties
TypeMultiple choice