Bytelearn - cat image with glassesAI tutor

Welcome to Bytelearn!

Let’s check out your problem:

Which recursive formula can be used to define this sequence for 
n > 1 ?

{:[-4, 3, 10, 17, 24, 31, dots],[a_n = a_(n-1) + a_(n-2) + 7],[a_n = -(3/4)a_(n-1)],[a_n = a_(n-1) + 7],[a_n = a_(n-1) + a_(n-2) - 7]:}
Submit
Desk 1

Which recursive formula can be used to define this sequence for n>1 ?\newline4,3,10,17,24,31,an=an1+an2+7an=34an1an=an1+7an=an1+an27 \begin{array}{l} -4,3,10,17,24,31, \ldots \\ a_{n}=a_{n-1}+a_{n-2}+7 \\ a_{n}=-\frac{3}{4} a_{n-1} \\ a_{n}=a_{n-1}+7 \\ a_{n}=a_{n-1}+a_{n-2}-7 \end{array} \newlineSubmit\newlineDesk 11

Full solution

Just a sec, we’re working out the solution to your problem...

Bytelearn - Loading gif

More problems from Solve one-step and two-step equations: word problems