The answer goes up by 12 each time
The recursive formula of the geometric sequence is given by option D; an = (1) × (5)^(n - 1) for n ≥ 1
<h3>How to determine recursive formula of a geometric sequence?</h3>
Given: 1, 5, 25, 125, 625, ...
= 5
an = a × r^(n - 1)
= 1 × 5^(n - 1)
an = (1) × (5)^(n - 1) for n ≥ 1
Learn more about recursive formula of geometric sequence:
brainly.com/question/10802330
#SPJ1
Step-by-step explanation:
x^3 is a perfect cube, 8 is a perfect cube, so we use difference of cubes.

Cube root of x^3 is x.
Cube root of 8 is 2
So
a=x
b= 2.

Set these equations equal to zero



If we do the discriminant, we get a negative answer so we would have two imaginary solutions,
Thus the only real root is 2.
If you want imaginary solutions, apply the quadratic formula.

and

So the 4 represents the amplitude of the function. We can also see that because it is a positive number, the graph is even. ⁽⁽The number before the graph type (Sin or Cos) always represents the amplitude. The amplitude is how many units the graph travels up and down from the midline.
The -2 is the midline. This means that the midline is at -2 on the Y-axis. To find the max and min, you then add the amplitude to find the maximum, and subtract to find the minimum. [-6. 2]
To find the period, you divide 2π by the term in front of x. In this case, it's 3, so we do 2π/3. This cannot be simplified further, but in degrees this equals 120°. This means that, with the question asking for 2 full cycles, that the graph will go through 2 full cycles in 240°
Hope this helps, sorry i couldn't sketch the graph for you
Answer:
GCF is 3
Step-by-step explanation: