Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » alt.math.undergrad.independent

Topic: Order of a recurrence relation
Replies: 4   Last Post: Jan 19, 2005 9:11 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Terry

Posts: 7
Registered: 1/25/05
Order of a recurrence relation
Posted: Jan 16, 2005 9:50 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


I know how to calculate the order of T(n)=2T(n/2) + 1. This i can do
it by T(n)=4T(n/4) + 2 +1 ie T(n)=2^i*T(n/2^i) + sum(2^i-1 to 1).

Now i have a recurrence relation T(n)=T(an)+T(bn) + cn where a+b=1
and T(1)=1.
Now how do i solve this recurrence relation.




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.