8x+3y=2

6x+2y=4

Tyra
2021-03-02
Answered

Solve the simultaneous Linear equations using matrix inverse Method.

8x+3y=2

6x+2y=4

8x+3y=2

6x+2y=4

You can still ask an expert for help

davonliefI

Answered 2021-03-03
Author has **79** answers

Step 1

To solve simultaneous linear equations, we have to find to form the equations into three matrices.

8x+3y=2

6x+2y=4

These can be shown in matrix form as,

Step 2

So if Ax=B , where A,x and B are matrices.

Then we can multiply it with

So find

Applying these row operations we get,

Step 3

x=5 , y=-10

Step 4

So the answers are x = 4 and y = -10

Jeffrey Jordon

Answered 2022-01-27
Author has **2313** answers

Answer is given below (on video)

asked 2021-01-31

Find a basis for the space of $2\times 2$ diagonal matrices.

$\text{Basis}=\{\left[\begin{array}{cc}& \\ & \end{array}\right],\left[\begin{array}{cc}& \\ & \end{array}\right]\}$

asked 2021-02-08

Let B be a 4x4 matrix to which we apply the following operations:

1. double column 1,

2. halve row 3,

3. add row 3 to row 1,

4. interchange columns 1 and 4,

5. subtract row 2 from each of the other rows,

6. replace column 4 by column 3,

7. delete column 1 (column dimension is reduced by 1).

(a) Write the result as a product of eight matrices.

(b) Write it again as a product of ABC (same B) of three matrices.

1. double column 1,

2. halve row 3,

3. add row 3 to row 1,

4. interchange columns 1 and 4,

5. subtract row 2 from each of the other rows,

6. replace column 4 by column 3,

7. delete column 1 (column dimension is reduced by 1).

(a) Write the result as a product of eight matrices.

(b) Write it again as a product of ABC (same B) of three matrices.

asked 2022-05-14

Integrals, Trig Substitutions with quartics: $\int \frac{x}{{({x}^{2}+2x+5)}^{2}}dx$

asked 2021-01-06

Prove that if B is symmetric, then $\Vert B\Vert $ is the largest eigenvalue of B.

asked 2022-04-29

Prove that $\mathrm{cos}x\cdot \mathrm{cos}\sqrt{3}x=1$ has exactly one solution at x=0

asked 2022-02-26

Find the solution:

$\frac{1+\mathrm{tan}\left(x\right)+{\mathrm{tan}}^{2}\left(x\right)+\dots +{\mathrm{tan}}^{n}\left(x\right)+\dots}{1-\mathrm{tan}\left(x\right)+{\mathrm{tan}}^{2}\left(x\right)-\dots +{(-1)}^{n}{\mathrm{tan}}^{n}\left(x\right)\dots}=1+\mathrm{sin}\left(2x\right)$

asked 2022-06-24

Choosing subsets of a set such that the subsets satisfy a global constraint

We have a set of items $I=\{{i}_{1},{i}_{2},...,{i}_{n}\}$. Each of these items has what we call a $p$ value, which is some real number. We want to choose a subset of $I$, call it ${I}^{\prime}$, of size $m$ (for some m with $1\le m\le n$) such that the average of the $p$ values of the items in ${I}^{\prime}$ falls within some specified range, $[{p}_{l},{p}_{u}]$.

We hope to do this in $O(n)$ time, but any polynomial time algorithm is good enough. We certainly do not want to just try every possible subset of I of size $m$ and then check whether it satisfies the average $p$-value constraint.

Finally, we will be doing this repeatedly and we want the subsets chosen to be a uniformly random distribution over all the possible such subsets.

Is there a way of doing this?

We have a set of items $I=\{{i}_{1},{i}_{2},...,{i}_{n}\}$. Each of these items has what we call a $p$ value, which is some real number. We want to choose a subset of $I$, call it ${I}^{\prime}$, of size $m$ (for some m with $1\le m\le n$) such that the average of the $p$ values of the items in ${I}^{\prime}$ falls within some specified range, $[{p}_{l},{p}_{u}]$.

We hope to do this in $O(n)$ time, but any polynomial time algorithm is good enough. We certainly do not want to just try every possible subset of I of size $m$ and then check whether it satisfies the average $p$-value constraint.

Finally, we will be doing this repeatedly and we want the subsets chosen to be a uniformly random distribution over all the possible such subsets.

Is there a way of doing this?