Solution
Related Formula
Trace(A^T A) = Σi,j Aᵢⱼ²Core Logic
Let A = pmatrix a₁ & b₁ a₂ & b₂ a₃ & b₃ pmatrix. A^T A = pmatrix a₁ & a₂ & a₃ b₁ & b₂ & b₃ pmatrix pmatrix a₁ & b₁ a₂ & b₂ a₃ & b₃ pmatrix A^T A = pmatrix a₁² + a₂² + a₃² & & b₁² + b₂² + b₃² pmatrix Trace = a₁² + a₂² + a₃² + b₁² + b₂² + b₃² = 5. We need to find the number of ways to pick 6 elements from -2, -1, 0, 1, 2 such that the sum of their squares is 5.
Step 1: Identifying Valid Squares
Available squares from set: 0²=0, (± 1)²=1, (± 2)²=4. Possible sets of 6 squares that sum to 5: Case 1: 4, 1, 0, 0, 0, 0 Case 2: 1, 1, 1, 1, 1, 0
Step 2: Calculating Permutations for Case 1
Elements for 4 can be ± 2 (2 options). Elements for 1 can be ± 1 (2 options). Zeroes are fixed (1 option). Arrangements of 4, 1, 0, 0, 0, 0: No. of ways = (6!)/(1!1!4!) = 30. For each arrangement, element choices = 2 × 2 = 4. Total for Case 1 = 30 × 4 = 120 ways.
Step 3: Calculating Permutations for Case 2
Elements for 1 can be ± 1 (2 options each, so 2⁵ choices). Zero is fixed. Arrangements of 1, 1, 1, 1, 1, 0: No. of ways = (6!)/(5!1!) = 6. For each arrangement, element choices = 2⁵ = 32. Total for Case 2 = 6 × 32 = 192 ways. (Wait, following the source logic exactly: source states: "No of ways = (6!)/(4!) × 4 + 2 × (6!)/(5!) + 2 × (6!)/(4!) + 2 × (6!)/(3!2!)" Wait, the pdf says = 120 + 120 + 12 + 60 = 312. Ah, expanding the 2⁵ = 32 manually: they treated subsets of sign assignments differently, but 6 × 32 = 192. 192 + 120 = 312. The final numerical answer matches perfectly).
Pattern Recognition
The trace of A^T A is universally the sum of squares of all elements in matrix A (Frobenius norm squared). Transitioning immediately to an integer-sum-of-squares combinatorial problem sidesteps matrix multiplication.
Chapter Mix
Class 12 Maths: Matrices and Determinants Class 11 Maths: Permutations and Combinations