# Fibonacci recurance relation

#### 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}$$

my answer is
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. Homework Statement

2. Homework Equations

3. The Attempt at a Solution
1. Homework Statement

2. Homework Equations

3. The Attempt at a Solution
1. Homework Statement

2. Homework Equations

3. The Attempt at a Solution
1. Homework Statement

2. Homework Equations

3. The Attempt at a Solution
1. Homework Statement

2. Homework Equations

3. The Attempt at a Solution

Related Precalculus Mathematics Homework Help News on Phys.org

#### lanedance

Homework Helper
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) + ...?$$

### Physics Forums Values

We Value Quality
• Topics based on mainstream science
• Proper English grammar and spelling
We Value Civility
• Positive and compassionate attitudes
• Patience while debating
We Value Productivity
• Disciplined to remain on-topic
• Recognition of own weaknesses
• Solo and co-op problem solving