Answer: 2nd option, 3rd option, and the last option are all correct
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 answer is straightforward, by the "rule of product":
There are
3×8×2=48
3×8×2=48
different combinations (distinct possible cars) that can be created.
There 33 choices for body style; 88 choices for exterior colors, and 22 choices of interior color schemes:
Since each of these choices are independent (the choice of body style doesn't depend on exterior or interior color, e.g.) we multiply the number of choices for each quality to obtain: 3×8×2=483×8×2=48 distinct ways to create a car
Answer:

Step-by-step explanation:
we know that
The area of the polygon is equal to the area of a square plus the area of four congruent triangles
so
![A=b^2+4[\frac{1}{2}(b)(h)]](https://tex.z-dn.net/?f=A%3Db%5E2%2B4%5B%5Cfrac%7B1%7D%7B2%7D%28b%29%28h%29%5D)
where

substitute
![A=8^2+4[\frac{1}{2}(8)(4)]](https://tex.z-dn.net/?f=A%3D8%5E2%2B4%5B%5Cfrac%7B1%7D%7B2%7D%288%29%284%29%5D)

Answer:
The correct answer is 2+2=4
thanks