Respuesta :
Answer:
C
Step-by-step explanation:
We want to find the recursive function of Max's stack of logs. Let's use the formula [tex]a_n=a_1+d(n-1)[/tex] to help us out.
In the formula, [tex]a_n[/tex] represents the nth term, [tex]a_1[/tex] represents the first term, and d is the common difference.
Since the first load of logs had 8 logs in it, we know that [tex]a_1=8[/tex]. Now, we want to find d, so let's use the information that [tex]a_7=62[/tex]. Plug these into the formula to find d:
[tex]a_n=a_1+d(n-1)[/tex]
[tex]a_7=a_1+d(7-1)[/tex]
62 = 8 + 6d
6d = 54
d = 9
Thus, our final equation is: [tex]a_n=8+9(n-1)[/tex], which is C.
Answer: it is 8 + 9(n - 1). (third one) 8 is the start of it. so, we have 6 loads left. subtract 62 from 8, leaving us with 54. then, 54 /6 equals 9, therefore the answer