9514 1404 393
Answer:
Step-by-step explanation:
A recursive formula consists of two parts:
- initialization (rule for the first term(s))
- rule for the next term
When we look at the differences between terms in the sequence 3, -4, -11, ..., we find that they are constant at -7. That is each term can be found from the previous one by subtracting 7. This is our recursive rule. The first term is obviously 3, so the recursive formula is ...
a[1] = 3
a[n] = a[n-1] -7
Answer:
i dont know much detail about this question but it could be 1. simplest answer
Step-by-step explanation:
Answer:
Infinitely Many Solutions
Step-by-step explanation:
Given
![\left[\begin{array}{cccccc}1&2&3&4&5&6\\7&6&5&4&3&2\\8&8&8&8&8&8\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccccc%7D1%262%263%264%265%266%5C%5C7%266%265%264%263%262%5C%5C8%268%268%268%268%268%5Cend%7Barray%7D%5Cright%5D)
Required
Determine the type of solution
From the matrix, we have:
3 non-zero rows and 5 variables (the last column is the result)
When the number of variables is more than the number of non-zero rows, then such system has infinitely many solutions
i.e.

