Answer:
use mathaway it helps all you have to do is take a picture it it will help u with the steps
Answer:
A
Step-by-step explanation:
This explanation mostly depends on what you're learning right now. The first way would be to convert this matrix to a system of equations like this.
g + t + k = 90
g + 2t - k = 55
-g - t + 3k = 30
Then you solve using normal methods of substitution or elimination. It seems to me that elimination is the quickest method.
g + t + k = 90
-g - t + 3k = 30
____________
0 + 0 + 4k = 120
4k = 120
k = 30
No you can plug this into the first two equations
g + t + (30) = 90
g + t = 60
and
g + 2t - (30) = 55
g + 2t = 85
now use elimination again by multiplying the first equation by -1
g + 2t = 85
-g - t = -60
_________
0 + t = 25
t = 25
Now plug those both back into one of the equations. I'll just do the first one.
g + (25) + (30) = 90
g = 35
Therefore, we know that Ted spent the least amount of time on the computer.
The second method is using matrix reduction and getting the matrix in the row echelon form, therefore solving using the gauss jordan method. If you would like me to go through this instead, please leave a comment.
Pls give the question to expect that u get answers from others
Thank u
"that were...."
-For my concern, please give more detail about this question and possibly explain.
The number of ways is 364 if the number of ways in which 4 squares can be chosen at random.
<h3>What are permutation and combination?</h3>
A permutation is the number of different ways a set can be organized; order matters in permutations, but not in combinations.
It is given that:
On a chessboard, four squares are randomly selected so that they are adjacent to each other and form a diagonal:
The required number of ways:
= 2(2[C(4, 4) + C(5, 4) + C(6, 4) + C(7, 4)] + C(8, 4))
= 2[2[ 1 + 5 + 15+35] + 70]
= 364
Thus, the number of ways is 364 if the number of ways in which 4 squares can be chosen at random.
Learn more about permutation and combination here:
brainly.com/question/2295036
#SPJ4