Proving Recurrence Relation for f(x)

AI Thread Summary
The recurrence relation given is log(f(x+2)) = log(f(x+1)) + log(f(x)), which simplifies to f(x+2) = f(x+1)f(x). The discussion focuses on proving that f(x) can be expressed as f(x) = e^(c1 L_x + c2 F_x). Participants question how to demonstrate the uniqueness of this solution. The conversation emphasizes the need for further exploration of properties related to the logarithm and the recurrence relation. Ultimately, the goal is to establish a clear proof of the proposed function form.
Char. Limit
Gold Member
Messages
1,222
Reaction score
23

Homework Statement


Let's say I had this recurrence relation:

log\left(f\left(x+2\right)\right) = log\left(f\left(x+1\right)\right) + log\left(f\left(x\right)\right)

How do I prove, then, that...

f\left(x\right) = e^{c_1 L_x + c_2 F_x}

?

Homework Equations



There probably are some, but I don't know any.

The Attempt at a Solution



I've gotten the equation to remove the logs, but I just get...

f\left(x+2\right) = f\left(x+1\right)f\left(x\right)

I don't know where to go from there.
 
Physics news on Phys.org
First, use the properties of the logarithm to get rid of the logarithm:
log(f(x+ 2))= log(f(x+1))+ log(f(x))= log(f(x+1)f(x))
and, since log is one-to-one, f(x+2)= f(x+1)f(x).

It's certainly true that the formula you gives satisfies that. Can you prove the solution is unique?
 
Back
Top