Results 1 to 2 of 2

Math Help - Solve the following recurrence relation in three ways

  1. #1
    Newbie
    Joined
    Dec 2012
    From
    athens
    Posts
    5

    Solve the following recurrence relation in three ways

    Hello again, this is a part of an exercise on Algorithms and Complexity.
    Solve the following recurrence relation in three ways: (a) implementation of the central theorem
    (b) using the recursion tree, and (c) the method of guess and inductive proof.

    T(1) = 1
    T(n) = 2T(n/4) + 3(n^2) for n > 1:

    You may assume that n is a power of 4. Justify your answers.

    i am going to post some answer i came out but with photo attachment because
    i can't write here the answear :S
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Dec 2012
    From
    athens
    Posts
    5

    Re: Solve the following recurrence relation in three ways

    Here is my try with the method of the Recursion tree. Do you spot any mistakes?
    Attached Thumbnails Attached Thumbnails Solve the following recurrence relation in three ways-tree.jpg  
    Last edited by SmartMonkey; December 17th 2012 at 12:04 PM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. How to solve this recursive equation/recurrence relation
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: November 13th 2012, 08:12 PM
  2. Replies: 2
    Last Post: October 29th 2012, 11:21 AM
  3. Solve the recurrence relation...
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: September 10th 2010, 05:16 AM
  4. Solve the recurrence relation
    Posted in the Advanced Math Topics Forum
    Replies: 2
    Last Post: May 15th 2010, 05:03 PM
  5. How to solve this recurrence relation ?
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: April 19th 2009, 04:31 PM

Search Tags


/mathhelpforum @mathhelpforum