Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

windsylph

  • 3 years ago

Recurrence Relations: Can you use generating functions to solve the recurrence relation T(n) = 2T(n-1) + n ?

  • This Question is Closed
  1. Jonask
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    \[T_1=2(0)+1=1\] \[T_2=2(1)+2,T_3=2(4)+3,T_4=2(9)+4...\] \[T_1=1,T_2=4,T_3=9,T_4=22...\]

  2. Jonask
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    i am nt sure what recuurance relation means

  3. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy