Answer:
Yes!
Step-by-step explanation:
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.
Answer:
(0,0)
Step-by-step explanation:
For the<span> geometric sequence, it has two forms of formula
</span>
<span>We are interested in the recursive formula now
</span>
<span>
{-80, 20, -5, ...}
The common ratio is (20/-80)=(-5/20)=-1/4=-0.25
So our r</span><span>ecursive formula would be
</span>
I hope that
helps!
