1
vote
1answer
31 views

How do I proceed from here on finding the Binet's formula via generating functions?

So, I'm stuck with the algebra for the nth number on the Fibonacci sequence in here. I managed to get to the part where $G(x) = \frac{x}{1-x-x^2}$ $=$ $\frac{x}{(1-\alpha x)(1-\beta x)}$, and I know ...
3
votes
1answer
54 views

Find a sequence

Find the function for the sequence $a_0 = 0, a_1 = 1$ and $a_{n}=a_{n+10}+a_n$ for all $n>0$.
5
votes
3answers
304 views

Closed form for the sum of even fibonacci numbers?

I recently took a look a project euler, and I am trying to think of a smart way to do number 2. I looked at the sequence, and I saw that the question is basically asking for $$ \sum_{i=1}^n F_{3i} $$ ...
4
votes
4answers
1k views

Closed form solution of Fibonacci-like sequence

Could someone please tell me the closed form solution of the equation below. $$F(n) = 2F(n-1) + 2F(n-2)$$ $$F(1) = 1$$ $$F(2) = 3$$ Is there any way it can be easily deduced if the closed form ...
2
votes
1answer
129 views

Finding n in Fibonacci closed loop form

The nth term of the Fibonacci series is given by $F_{n}$=$\Big\lfloor\frac{\phi^{n}}{\sqrt{5}}+\frac{1}{2}\Big\rfloor$ How do you get the following expression for n from this? ...