Results 1 to 1 of 1

Math Help - How can I solve this recursive relation?

  1. #1
    Junior Member
    Joined
    Jul 2012
    From
    Morocco
    Posts
    25

    How can I solve this recurrence relation?

    \\f(n, m) =\begin{cases}0, & \text{if }n,m < 0\\1, & \text{if }n,m = 0\\\sum_{i = 0}^{k = max(n, m)}([f(n - i, m - [k - i]) + c]\binom{k}{i}) - c(2^{k - 1} + 1), & \text{otherwise}\end{cases}
    Last edited by mohamedennahdi; March 1st 2014 at 10:31 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. Is this relation recursive?
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: December 6th 2011, 09:25 AM
  3. Recursive relation
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: July 20th 2010, 10:59 PM
  4. Solve the recurrence relation
    Posted in the Advanced Math Topics Forum
    Replies: 2
    Last Post: May 15th 2010, 05:03 PM
  5. Replies: 4
    Last Post: April 27th 2010, 07:57 AM

Search Tags


/mathhelpforum @mathhelpforum