If A = [ * 20 c 2&3 4&6 ], then A^ - 1 = - Vidyadip

MCQ

If $A = \left[ {\begin{array}{*{20}{c}}2&3\\4&6\end{array}} \right]$, then ${A^{ - 1}}$=

A
$\left[ {\begin{array}{*{20}{c}}1&2\\{ - 3/2}&3\end{array}} \right]$
B
$\left[ {\begin{array}{*{20}{c}}2&{ - 3}\\4&6\end{array}} \right]$
C
$\left[ {\begin{array}{*{20}{c}}{ - 2}&4\\{ - 3}&6\end{array}} \right]$
✓
Does not exist

✓

Answer

Correct option: D.

Does not exist

d
(d) Given,$A = \left[ {\begin{array}{*{20}{c}}2&3\\4&6\end{array}} \right]$,

we know that ${A^{ - 1}} = \frac{{adj.A}}{{|A|}}$.

Therefore, $|A|\,\, = \,\,[12 - 12] = 0.$

Since $|A|$ is zero,

therefore inverse of $A$ does not exist.

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 3 and 4 . determinant and metrices→3 and 4 . determinant and metrices — all question types→Maths STD 12 Science question papers→Gujarat Board STD 12 Science question papers→Gujarat Board question paper generator→

Similar questions

The sum of all the local minimum values of the twice differentiable function $\mathrm{F}: \mathrm{R} \rightarrow \mathrm{R}$ defined by $f(x)=x^{3}-3 x^{2}-\frac{3 f^{\prime \prime}(2)}{2} x+f^{\prime \prime}(1)$ is:

The value of $\int \cos ^2 x d x$ will be

If A and B are two independent events such that P(A) = 0.3 and $\text{P}(\text{A}\cup\text{B})=0.5,$ then P(A|B) - P(B|A) =

$\frac{2}{7}$
$\frac{3}{35}$
$\frac{1}{70}$
$\frac{1}{7}$

The objective function Z = 4x + 3y can be maximised subjected to the constraints 3x + 4y ≤ 24, 8x + 6y ≤ 48, x ≤ 5, y ≤ 6, x, y ≥ 0

at only one point
at two points only
at an infinite number of points
none of these

If $\int {\sqrt 2 \sqrt {1 + \sin x} } \,\,dx = - \,4\cos (ax + b) + c$ then the value of $(a, b) $ is

If the diraction ratios of a line are proportional to 1, -3, 2, then its diraction cosines are:

Least integer in the range of $f(x)$=$\sqrt {(x + 4)(1 - x)} - {\log _2}x$ is

If $\hat x,\,\hat y$ and $\hat z$ are three unit vectors in three dimensional space , then the minimum value of ${\left| {\hat x + \hat y} \right|^2}\, + \,{\left| {\hat y + \hat z} \right|^2}\, + \,{\left| {\hat z + \hat x} \right|^2}$

The total number of matrices $A = \left[ {\begin{array}{*{20}{c}}
0&{2x}&{2x}\\
{2y}&y&{ - y}\\
1&{ - 1}&1
\end{array}} \right];\,\left( {x,y \in R,\,x \ne y} \right)$ for which ${A^T}A = 3{I_3}$

In an LPP, if the objective function $Z=a x+b y$ has the same maximum value on two corner points of the feasible region, then the number of points at which $Z_{\max }$ occurs is