# A Recurrence Relation and the root of a quadratic

Let $$\rho$$ be a root of: $$x^2-2x-1=0$$

Define a function $$F(n) \mid n \in \mathbb N$$ by the recurrence relation:

• $$F(0)=0$$

• $$F(1)=1$$

• $$F(n)= 2F(n-1)+F(n-2) \mid n \geq 2$$

Prove that for all integers $$n\geq1$$:

$\rho^n = F(n-1)+F(n)\rho$

Note by Yan Yau Cheng
4 years, 1 month ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Hint: Use Induction

- 3 years, 1 month ago