MCQ
If for $A=\left[\begin{array}{cc}\alpha & \beta \\ \gamma & -\alpha\end{array}\right], A^2=I$, then __________ .
  • A
    $1+\alpha^2-\beta \gamma=0$
  • B
    $1-\alpha^2+\beta \gamma=0$
  • $1-\alpha^2-\beta \gamma=0$
  • D
    $1+\alpha^2+\beta \gamma=0$

Answer

Correct option: C.
$1-\alpha^2-\beta \gamma=0$
C

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Similar questions

${d \over {dx}}\left( {{x^3}{{\tan }^2}{x \over 2}} \right)=$
Choose the correct answer from the given four options.
Let f : [0, 1] → [0, 1] be defined by $\text{f}(\text{x})=\begin{cases}\text{x, if x is rational}\\1-\text{x, if x is irrational}\end{cases}$ Then (fof)x is:
  1. constant
  2. 1 + x
  3. x
  4. none of these.
The optimal value of the objective function is attained at the points
Lines $\frac{1-x}{3}=\frac{y-2}{1}=\frac{z-1}{2}$ and $\frac{x-2}{p}=\frac{y-1}{2}=\frac{z-2}{1}$ are mutually perpendicular to each other then, $p=$ ___________ .
If ${x^2} + {y^2} = t - {1 \over t},$ ${x^4} + {y^4} = {t^2} + {1 \over {{t^2}}}$, then ${x^3}y{{dy} \over {dx}} = $
If $[ t ]$ denotes the greatest integer $\leq t$, then the value of $\int_{0}^{1}\left[2 x-\left|3 x^{2}-5 x+2\right|+1\right] d x$ is.
Solution of the differential equation $y' = y\tan x - 2\sin x,$ is
For all real values of  $x$ , increasing function  $f(x)$  is
For determinant A, if $A=\left|\begin{array}{ccc}1 & 2 & 13 \\ 3 & 0 & 5 \\ 6 & 7 & 11\end{array}\right|$ and p, q and r are cofactors of 13, 5 and 11 respectively, then p + 3q + 6r = _________.
Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that.
  1. The values of decision variables obtained by rounding off are always very close to the optimal values.
  2. The value of the objective function for a maximization problem will likely be less than that for the simplex solution.
  3. The value of the objective function for a minimization problem will likely be less than that for the simplex solution.
  4. All constraints are satisfied exactly.
  5. None of the above.