If for the matrix A, A^3=1, than A^ -1 = - Vidyadip

MCQ

If for the matrix $A, A^3=1$, than $A^{-1}=$

✓
$A^2$
B
$A^3$
C
$A$
D
None of these.

✓

Answer

Correct option: A.

$A^2$

$A^3=1$
$\Rightarrow A^{-1} A^3=A^{-1} \mid$
$\Rightarrow\left|A^2=A^{-1}\right|$
$\Rightarrow A^2=A^{-1}$

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

Explore more

More "M.C.Q (1 Marks)" from Determinants→Determinants — all question types→Maths STD 12 Science question papers→Gujarat Board STD 12 Science question papers→Gujarat Board question paper generator→

Similar questions

At $\text{x}=\frac{5\pi}{6},\text{ f(x)}=2\sin3\text{x}+3\cos\text{x}$ is $6 :$

If $A$ is $3 \times 4$ matrix and $B$ is matrix such that $AB$ and $BA$ are both defined, then $B$ is of the type :

$\mid\text{a}\times\text{b}\mid^2+\mid\text{a.b}\mid^2=144$ and $\mid\text{a}\mid=4$ then $\mid\text{b}\mid$ is equal to:

The corner points of the feasible region are $A(0, 0), B(16, 0), C(8, 16)$ and $D(0, 24).$ The minimum value of the objective function $z = 300x + 190y$ is $........$

A die is tossed $5$ times. Getting an odd number is considered a success. Then the variance of distribution of success is

Let $\vec{b}=\hat{i}+\hat{j}+\lambda \hat{k}, \lambda \in R$. If $\vec{a}$ is a vector such that $\overrightarrow{ a } \times \overrightarrow{ b }=13 \hat{ i }-\hat{ j }-4 \hat{ k } \quad$ and $\quad \overrightarrow{ a } \cdot \overrightarrow{ b }+21=0$, then $(\vec{b}-\vec{a}) \cdot(\hat{k}-\hat{j})+(\vec{b}+\vec{a}) \cdot(\hat{i}-\hat{k})$ is equal to

Two dice are thrown. If it is known that the sun of the numbers on the dice was less than $6,$ than the probability of gettinga sum $3,$ is

If $\left|\begin{array}{lll}2 & 3 & 2 \\ x & x & x \\ 4 & 9 & 1\end{array}\right|+3=0$, then the value of $x$ is

If $\tan (x + y) + \tan (x - y) = 1,$ then ${{dy} \over {dx}} = $

In an $\text{LPP},$ if the objective function $Z = ax + by$ has the same maximum value on two corner points of the feasible region, then the number of points of which $Z$ max occurs is: