Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

Write an explicit formula for the sequence determined by the recursion formula \[t n = 0.5t _{n-1}+n\] t1=40, t2=22, t3=13, t4 = 8.5, t5=6.25 Please explain how to get to the answer rather than just the answer. Thanks :)

I got my questions answered at in under 10 minutes. Go to now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly


Get your free account and access expert answers to this and thousands of other questions

I used this site to help me understand how to solve this:

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

your answers are not correct
yeah I just realized that
yes - the equation I ended up with agrees with the values found by mahmit2012
I can let you know what equation I found if you want - or do you want to try it yourself first?
I know the answer, it's tn= ((n+1)(n+2))/2 but I don't know how to get to it
I haven't done problems like this before but found that document and followed it to get the answer
I actually got:\[t_n=80(\frac{1}{2})^n+2(n-1)\]
yeah but the textbook gave me the answer I posted. And that website uses very complex explanations :$
your formula does not produce the right answers
take n=1 - it produces the value 3
yeah I just checked, you're right it gave me the wrong answer.
if you use the formula I derived then it matches all the values (listed by mahmit2012)
I can try and explain the steps I took to derive this
okay, thanks that would be good
ok - first it said arrange the recurrence relation in the form:\[At_n+Bt_{n-1}+Ct_{n-2}+...=f(n)\]so I arranged your relation as:\[t_n-0.5t_{n-1}=n\tag{a}\]it then said the general solution when f(n) is zero is \(t_n=A(0.5)^n\). It then said that to take account of f(n) we need to add in a solution of the form \(Bn+C\). So we substitute this into (a) to get:\[Bn+c-0.5(B(n-1)+C)=n\]which leads to:\[0.5Bn+0.5(B+C)=n\]and if we equate coefficients of LHS and RHS we get:\[B=2\]\[B+C=0\implies C=-B=-2\]so the second part of the equation is of the form:\[2n-2\]we add this to the first part to get the answer:\[t_n=A(0.5)^n+2n-2\]then use the fact that \(t_1=40\) to find A.
hope it all makes sense?
thanks a lot guys :)
yw :)

Not the answer you are looking for?

Search for more explanations.

Ask your own question