This sequence be represented as a recursive equation by a1=8 and an=2a1
<u>Step-by-step explanation</u>:
- 'Recursive' refers to the repetition of a specific process in a sequence.
- The given sequence is {8,16,32,64}.
- If the value is 2 times the previous value, then an=2a(n-1)
Let a1=8,
then a2 = 2a(2-1)
⇒ a2 = 2a1
⇒ a2 = 2(8)
⇒ a2 = 16
Similarly,
For a2=16,
⇒ a3 = 2(a2)
⇒ a3 = 2(16)
⇒ a3 = 32
For a3=32,
⇒ a4 = 2(a3)
⇒ a4 = 2(32)
⇒ a4 = 64
∴ The equation is recursive as a1=8 and an=2a1 to follow the sequence.
Answer:
correct
Step-by-step explanation:
he is correct because the transformation is a translation and under the translation the image and preimage are congruent.
the measure of the sides are preserved, and the peasure of the angles are preserved so if all the corsponding sides and angles are congruent the hexagons are congruent too
Answer:
yeahhh no. go answer questions.
The relation of t as in to what?
