Let A=[α12230045]A = \begin{bmatrix} \alpha & 1 & 2 \\ 2 & 3 & 0 \\ 0 & 4 & 5 \end{bmatrix}A=α20134205 and B=[1000−5α004α−2α]+adj(A)B = \begin{bmatrix} 1 & 0 & 0 \\ 0 & -5\alpha & 0 \\ 0 & 4\alpha & -2\alpha \end{bmatrix} + \text{adj}(A)B=1000−5α4α00−2α+adj(A). If det(B)=66\det(B) = 66det(B)=66, then det(adj(A))\det(\text{adj}(A))det(adj(A)) equals :
289
361
441
529
det(adj(A))=(det(A))n−1\det(\text{adj}(A)) = (\det(A))^{n-1}det(adj(A))=(det(A))n−1
adj(A)=[153−6−105α48−4α3α−2]\text{adj}(A) = \begin{bmatrix} 15 & 3 & -6 \\ -10 & 5\alpha & 4 \\ 8 & -4\alpha & 3\alpha-2 \end{bmatrix}adj(A)=15−10835α−4α−643α−2
B=[1000−5α004α−2α]+[153−6−105α48−4α3α−2]B = \begin{bmatrix} 1 & 0 & 0 \\ 0 & -5\alpha & 0 \\ 0 & 4\alpha & -2\alpha \end{bmatrix} + \begin{bmatrix} 15 & 3 & -6 \\ -10 & 5\alpha & 4 \\ 8 & -4\alpha & 3\alpha-2 \end{bmatrix}B=1000−5α4α00−2α+15−10835α−4α−643α−2
B=[163−6−100480α−2]B = \begin{bmatrix} 16 & 3 & -6 \\ -10 & 0 & 4 \\ 8 & 0 & \alpha-2 \end{bmatrix}B=16−108300−64α−2
det(B)=−3[−10α+20−32]=−3(−10α−12)=30α+36\det(B) = -3 \left[ -10\alpha + 20 - 32 \right] = -3(-10\alpha - 12) = 30\alpha + 36det(B)=−3[−10α+20−32]=−3(−10α−12)=30α+36
30α+36=66 ⟹ 30α=30 ⟹ α=130\alpha + 36 = 66 \implies 30\alpha = 30 \implies \alpha = 130α+36=66⟹30α=30⟹α=1
det(A)=15(1)+6=21\det(A) = 15(1) + 6 = 21det(A)=15(1)+6=21
det(adj(A))=212=441\det(\text{adj}(A)) = 21^2 = 441det(adj(A))=212=441
Tagged Adjoint and inverse of a matrix. Machine-assigned, so read it as a strong shortlist rather than a verdict.