2+3+7+8=20
2 x 3+7+ 8= 21
2 x 7 + 3+ 8= 25
8 x 2 + 7 + 3= 26
3 x 7 +8 - 2= 27
8 x 3 + 7 - 2= 29
8 x 7 ÷ 2 + 3= 31
7 x 2 x 3 -8 = 34
There is a couple, but i am not doing all of them
I hope this helps anyway :).
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)]