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)]
Answer:
False
Step-by-step explanation:
Consider the equations with the same number of equations and variables as shown below,
<u>Case 1</u>
This equation has no solution because it is not possible to have two numbers that give a sum of 0 and 1 simultaneously.
<u>Case 2</u>
This equation has infinitely many possible solutions.
Therefore it is FALSE to say a linear system with the same number of equations and variables, must have a unique solution.
