Simplifying a recursive function

Click For Summary

Homework Help Overview

The discussion revolves around finding a formula for a recursive function defined as f(x) = a*f(x-1) + b*f(x-2) for x≥1, given initial conditions f(-1) and f(0). Participants are exploring methods to express f(x) solely in terms of the parameters a, b, f(-1), and f(0).

Discussion Character

  • Exploratory, Mathematical reasoning, Problem interpretation

Approaches and Questions Raised

  • Participants discuss various methods for simplifying the recursive function, including substituting specific forms for f(x) and examining patterns from initial terms. Some question the appropriateness of their approaches, while others suggest different strategies for deriving a general expression.

Discussion Status

The discussion is active, with participants sharing insights and suggestions. Some have attempted to compute specific values and explore relationships between them, while others are considering standard methods for solving similar types of recursive equations. There is no explicit consensus on a single approach yet.

Contextual Notes

Participants are working under the assumption that f(-1) and f(0) are known, and there is a focus on deriving a general formula without resolving the recursion completely.

randommacuser
Messages
23
Reaction score
0
I am trying to find a formula for f(x) = a*f(x-1) + b*f(x-2) for x≥1, assuming f(-1) and f(0) are known. In other words, I need some expression for f(x) just in terms of a, b, f(-1), and f(0).

I tried plugging in stuff and factoring on paper for the first few iterations, but it quickly got out of control. Then I let Mathematica do the grunt work and tried to see some patterns as x increases. But so far I am only seeing the obvious first couple of terms: a^x * f(0) - (x-1) * a^(x-1) * b * f(0)

Any clues? Should I even be doing the problem this way, or is there some simpler method?
 
Last edited:
Physics news on Phys.org
just a question...the function is x and the variable is n?
 
Well, that was the way the problem was stated. I've edited the OP to make it more standard. Now f is a function of the variable x, as usual.
 
hey man did u try to get f(1) and then replace it in f(2) and so on u will find a relation between f(2) with just f(0) and f(-1) in it with some factorize and like that ... try it
 
Try substituting f(x) = m^x for some m, and see where that gets you (this is a standard method for solving homogeneous constant coefficient linear recurrences. It's analogous to solving homogeneous constant coefficient linear ODEs using an exponential substitution).
 
Last edited:
moe_3_moe: Yes, I did this by hand to about f(5) and on Mathematica to f(10). But the goal is one expression of f(x), for all x, in terms of the four given parameters.
 
ok get it ... let's see what we can do ... at least now we know how mathematica works hard lol ...
 
data...can we have more details about ur suggestion
 
Using that substitution you can find the values for m that give you solutions. There will be two of them. The general solution is a linear combination of the two; use the given values for f(0) and f(-1) to find the particular solution.
 
  • #10
right thanks ..it did work ...
 
  • #11
Perfect. Thanks for your help, Data.
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
1K
  • · Replies 8 ·
Replies
8
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
8
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K