Start Learning Free

Before You Begin

Question #41023

Difficulty: 8/10 | 🟢 Free

The Question

Let S={z∈C:z12=1}S = \{z \in \mathbb{C} : z^{12} = 1\}. Find the number of matrices A=(abcd)A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} with entries from SS such that AAˉ≠AˉAA \bar{A} \neq \bar{A} A, where Aˉ\bar{A} is the complex conjugate of AA.

Options

  • A.

    20208

  • B.

    20160

  • C.

    20448

  • D.

    20472

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

Combinatorial Counting|Roots of Unity Properties|Conjugate Root Theorem|Matrix Multiplication Non-Commutativity

Why This Question Is Tricky

Common Mistakes

The trap tests the combinatorial counting of matrices over roots of unity under non-commutative constraints (AAˉ≠AˉAA\bar{A} \neq \bar{A}A).

Students must equate matrix elements, leading to trigonometric conditions that partition the roots.

The 'Lethal Collision' occurs when counting the pairs (a,d)(a,d) satisfying (a−d)/b∈R(a-d)/b \in \mathbb{R}.

Students correctly identify the two cases (a=da=d and ad=−b2ad=-b^2) but fail to subtract the overlap (a=±iba=\pm ib).

Because ii is a 12th root of unity, this overlap always exists and often manifests as real roots (e.g., when b=ib=i, a=±1a=\pm 1).

Ignoring this overlap leads to double-counting and the trap answer 20160.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 11
ConceptCombinatorial Counting (P&C Integration)
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree