- A$x=\frac{6}{11},y=\frac{-19}{11}$
- B$x=\frac{-6}{11},y=\frac{19}{11}$
- C$x=\frac{6}{11},y=\frac{19}{11}$
- ✓$x=\frac{-6}{11},y=\frac{-19}{11}$
$A=\left[\begin{array}{ll}4 & -3 \\ 3 & -5\end{array}\right], X=\left[\begin{array}{l}x \\ y\end{array}\right]$ and $B=\left[\begin{array}{l}3 \\ 7\end{array}\right]$
Now,
$|A|=-20+9=-11 \neq 0$
Thus, $A$ is non-singular. Therefore, its inverse exists.
Now,
$A^{-1}=\frac{1}{|A|}(a d j A)=-\frac{1}{11}\left[\begin{array}{ll}
-5 & 3 \\
-3 & 4
\end{array}\right]=\frac{1}{11}\left[\begin{array}{ll}
5 & -3 \\
3 & -4
\end{array}\right]$
$\therefore X=A^{-1} B=\frac{1}{11}\left[\begin{array}{ll}5 & -3 \\ 3 & -4\end{array}\right]\left[\begin{array}{l}3 \\ 7\end{array}\right]$
$\Rightarrow\left[\begin{array}{l}x \\ y\end{array}\right]=\frac{1}{11}\left[\begin{array}{ll}5 & -3 \\ 3 & -4\end{array}\right]\left[\begin{array}{l}3 \\ 7\end{array}\right]$
$=\frac{1}{11}\left[\begin{array}{c}15-21 \\ 9-28\end{array}\right]$
$=\frac{1}{11}\left[\begin{array}{l}-6 \\ -19\end{array}\right]$
$=\left[\begin{array}{r}-\frac{6}{11} \\ -\frac{19}{11}\end{array}\right]$
Hence, $x=\frac{-6}{11}$ and $y=\frac{-19}{11}$
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
Maximize $z=2 x+3 y$ the coordinates of the corner points of the bounded feasible region are $A\,(3,3), B\,(20,3),$ $\mathrm{C}\,(20,10), \mathrm{D}\,(18,12)$ and $\mathrm{E}\,(12,12) .$ The maximum value of $z$ is $\ldots \ldots$
$(A)$ $N ^{\top} M N$ is symmetric or skew symmetric, according as $M$ is symmetric or skew symmetric
$(B)$ $M N-N M$ is skew symmetric for all symmetric matrices $M$ and $N$
$(C)$ $M N$ is symetric for all symmetric matrices $M$ and $N$
$(D)$ $(\operatorname{adj} M)(\operatorname{adj} N)=\operatorname{adj}(M N)$ for all invertible matrices $M$ and $N$