Answer:
a(n)=1.15[a(n-1)]
Step-by-step explanation:
we know that

Let
a0 -----> the length of the original copy
<em>The first copy is equal to</em>
a1=1.15(a0)
<em>The second copy is </em>
a2=1.15[1.15(a0)] or a2=1.15[a1]
<em>The third copy is</em>
a3=1.15{1.15[1.15(a0)]} or a3=1.15[a2]
therefore
A recursive formula will be
a(n)=1.15[a(n-1)]
The procedure is to make the difference of the terms that occupy the same position (column and row):
| - 6 - 4 | | - 5 5 | | - 6 + 5 - 4 - 5 | | -1 - 9 |
| 6 0 | - | - 4 -1 | = | 6 + 4 0 + 1 | = | 10 1 |
| 6 4 | | 6 - 4 | | 6 - 6 4 + 4 | | 0 8 |
Answer: option B.
The second one is the answer
Answer:
5 hours
Step-by-step explanation:
give me brain list