Learn To Be brings free online tutoring students around the United States. Volunteer and gain community service hours while helping students who need it./p>

Converting recursive & explicit forms of arithmetic sequences

f(n)=93+4(n1)f(n)=93+4(n-1)
Complete the recursive formula of f(n)f(n).
f(1)=f(1)=
  • Your answer should be
  • an integer, like 66
  • a simplified proper fraction, like 3/53/5
  • a simplified improper fraction, like 7/47/4
  • a mixed number, like 1 3/41\ 3/4
  • an exact decimal, like 0.750.75
  • a multiple of pi, like 12 pi12\ \text{pi} or 2/3 pi2/3\ \text{pi}
f(n)=f(n1)+f(n)=f(n-1)+
  • Your answer should be
  • an integer, like 66
  • a simplified proper fraction, like 3/53/5
  • a simplified improper fraction, like 7/47/4
  • a mixed number, like 1 3/41\ 3/4
  • an exact decimal, like 0.750.75
  • a multiple of pi, like 12 pi12\ \text{pi} or 2/3 pi2/3\ \text{pi}