# Fibonacci recurance relation

1. Mar 17, 2009

### morbello

i have to find the recurrence relation to express both f$$_{n+1}$$ and f$$_{n}$$ with f$$_{n+2}$$ and f$$_{n+3}$$

f$$_{n+1}$$+f$$_{n+2}$$+f$$_{n+3}$$.....f$$_{n}$$

ive got other ways off doing it in the book but they do not use f$$_{n+3}$$

these are

f$$_{n+2}$$+f$$_{f-1}$$-f$$_{n}$$

they all should be in lower case but i can not seam to get the post to do it i hope it does not make it hard to help me with the question.

3. The attempt at a solution
1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution
1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution
1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution
1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution
1. The problem statement, all variables and given/known data

2. Relevant equations

3. The attempt at a solution

2. Mar 17, 2009

### lanedance

hi morbello

you can click on any latex code to see how it is typed, easiest to put tex quotes around your whole equation

but I'm not too sure what you're trying to do... ;) shouldn't you have an equals sign somewhere?

something like
$$f^{n+1} = f(n+1) = f(n) + ...?$$