trentbrock6321 trentbrock6321
  • 14-01-2020
  • Mathematics
contestada

Work the following recursive problems. Find f(1), f(2), f(3) and f(4) if f(n) is defined recursively by f(0)=-1, f(1)=2 and for n=1,2,3...

Respuesta :

EamonnAdams1992 EamonnAdams1992
  • 14-01-2020

Answer:

-1, 2, 5, 8

Step-by-step explanation:

We can use the nth term equation to solve for f(3) and f(4):

[tex]f_n=a_1+(n-1)\cdot{d}[/tex]

Where d is the difference of term 1 and 2:

[tex]d=2-(-1)=3[/tex]

Therefore:

[tex]f_3=-1+(3-1)\cdot{3}=5[/tex]

[tex]f_4=-1+(4-1)\cdot{3}=8[/tex]

Answer Link

Otras preguntas

Which of the following equations have the correct solution select all that apply
They always go to school …… bicycle. a.with b.in c.on d.by
Which remained strongly organized and grew more powerful as the Western Roman Empire collapsed? The military command The Roman Catholic Church The office of
what is 3.1 × 10 1 in standard form
Which organelle is the red arrow pointing towards? Brainliest to right answer
Which of the following is correct? both David, be sure to mind your ps and qs. David, be sure to mind your p's and q's.
What would you do/not do for a million dollars?
8.3 as a mixed number
Thomas knows that he should figure out his resting heart rate to compare it with his heart rate while he is exercising, but he does not know why. What is the BE
Which statement best describes an environmental consequence of unsealed landfills? Landfills can produce carbon dioxide that leak into the atmosphere. Long-ter