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)]
I completely agree with the above statement
Answer:
12
Step-by-step explanation:
i done the butterfly method
Answer:
greatest 9776410 smallest 1046779
Step-by-step explanation:
in smallest we cannot write 0 first because 0 has no units
Answer:
s = 180
Step-by-step explanation:
s is the total number of seventh-grade students
1/10s take French which is 18
1/10s = 18
s = 18(10)
s = 180
