<span>The quadrilateral ABCD have vertices at points A(-6,4), B(-6,6), C(-2,6) and D(-4,4).
</span>
<span>Translating 10 units down you get points A''(-6,-6), B''(-6,-4), C''(-2,-4) and D''(-4,-6).
</span>
Translaitng <span>8 units to the right you get points A'(2,-6), B'(2,-4), C'(6,-4) and D'(4,-6) that are exactly vertices of quadrilateral A'B'C'D'.
</span><span>
</span><span>Answer: correct choice is B.
</span>
Answer:
An infinite number of solutions
Step-by-step explanation:
This is because of all the 0's the zeros represent none and none is infinite. When in the matrix you are solving and solving is a infinite. When times 0 is 0 and when divided by 0 is infinite so an infinite amount of answers.
Answer:
Step-by-step explanation:
Problem A
t(1) = 2(1) + 5
t(2) = 2*2 + 5 = 9
t(3) = 2*3 + 5 = 11
t(4) = 2*4 + 5 = 13
So this is the explicit result. Now try it recursively.
t_3 = t_2 + 2
t_3 = 9 + 2
t_3 = 11 which is just what it should do.
t_n = t_(n - 1) + 2
Problem B
t(1) = 3 * 1/2
t(1) = 3/2
t(2) = 3*(1/2)^2
t(2) = 3 * 1/4
t(2) = 3/4
t(3) = 3*(1/2)^3
t(3) = 3 * 1/8
t(3) = 3/8
t(4) = 3 (1/2)^4
t(4) = 3 (1/16)
t(4) = 3/16
So in general
t_n = t_n-1 * 1/2
For example t(5)
t_5 = t_4 * 1/2
t_5 = 3 /16 * 1/2 = 3/32
