Questions tagged [fibonacci-numbers]

Questions on the Fibonacci numbers, a special sequence of integers that satisfy the recurrence $F_n=F_{n-1}+F_{n-2}$ with the initial conditions $F_0=0$ and $F_1=1$.

The $n$th Fibonacci number $F_n$ is defined recursively, by

$$F_n = F_{n - 1} + F_{n - 2}$$

for $n > 1$, and $F_0 = 0,\; F_1 = 1$. There is a closed form expression, namely

$$F_n = \frac{\varphi^n - (1 - \varphi)^n}{\sqrt{5}}$$

where the golden ratio $\varphi$ is equal to $\frac{1 + \sqrt{5}}{2}$.

Combinatorial identities involving the Fibonacci numbers have been extensively studied, and the numbers arise frequently in nature and in popular culture.

Reference: Fibonacci number.

2190 questions
0
votes
1 answer

A Property of Fibonacci Numbers

I've seen the property $$f_{n+1} f_{n−1} = f_n^2 + (−1)^n, n ≥ 2.$$ for Fibonacci numbers at Abstract Algebra book of Thomas W. Judson. I've tried it for a few Fibonacci number, and I've really liked how the pattern goes. I've tried to prove it by…
errorist
  • 315
0
votes
2 answers

How to find a formula relating fibonacci sequence?

By shifting property of fibonacci numbers, $$F_{m+n} = F_m · F_{n+1} + F_{m-1} · F_n$$ where $F_k$ denotes the kth Fibonacci number . I want to extend it to some n numbers . So , how to find a formula for $F_{k_1+k_2+k_3+...+k_n}$ ?
vidhan
  • 1,020
0
votes
0 answers

How to prove a claim about Fibonacci sequence

I have to prove that for any natural number $n$ there exists $i>0$ such that $n\mid F_i$, where $F_i$ is the $i$-th Fibonacci number.
0
votes
0 answers

Identify fibonacci sequences from a set of data

Let there be a set of increasing order integer data ${a_1, a_2, a_3, a_4, ...}$. given the increasing infinite sequence of integers, how can we determine whether there is an infinite subsequence which is a subsequence of a shifted fibonacci…
Anthony
  • 53
0
votes
2 answers

Applying the mean value theorem to the closed form of the Fibonacci sequence?

Is it possible to apply the mean value theorem to the closed form of the Fibonacci sequence for the 7 numbers starting at 1 and ending with 13 (inclusive)? It's been a LONG time since I studied university-level math, and it would take me a long…
clm
  • 1
0
votes
2 answers

Fibonacci even numbers formula

i found a general formula in any given set of Fibonacci numbers ,to find the next given even number we can use the formula E*4 + Eo where E is the given even number Eo is the even number that comes before the given even number for example…
0
votes
1 answer

Hyper sum of Fibonacci numbers

Let $F(n)$ be the $n$-th Fibonacci number. That is, $F(n)$ satisfies $F(0)=0,F(1)=1,F(n)=F(n−1)+F(n−2) (if n≥2).$ Let $f_k(n)$ be the function such that $f_0(n) = F(n)$, $f_k(n) = \sum\limits_{i=1}^n f_{k-1}(i)\ \ ({\rm if}\ k \ge 1)$. You are…
user207013
0
votes
2 answers

Problem on deriving binet formula

I'm trying to understand binet formula. I got a good explanation here. Please look at the link. Everything just fine but one thing. It said that $A_n = A_{n-1} + A_{n-2}$, which is fibonacci. But why $A_n = Cx^n$?
guest
  • 1
-1
votes
2 answers

Please help to understand Fibonacci numbers' property.

Theorem: The Fibonacci numbers are defined recursively thus: $$x_{n+1} = x_n + x_{n-1}$$ with $$x_1=x_2=1.$$ Prove that $$x_n=(a^n-b^n)/(a-b),$$ where $a$ and $b$ are the roots of the quadratic equation $x^2-x-1=0$. I found this proof, apparently…
Silent
  • 6,520
-1
votes
1 answer

Generalization of Vajda's identity

I have discovered an identity which generalizes Vajda's identity concerning Fibonacci Numbers. The identity states that: $$F_{n+i+x-z}F_{n+j+y+z}-F_{n+x+y-k}F_{n+i+j+k}=(-1)^{n+x+y-k}F_{i+k-y-z}F_{j+k-x+z}$$ Note that Vajda's identity states…
-1
votes
1 answer

Deducing an answer on whether n is odd or even

How can I deduce the following: \begin{align*} F_{n}{^2} - F_{n+1}* F_{n-1}= +1 \text{ or} -1 \end{align*} Just from knowing if $n$ is even or odd? I have worked out by hand that if $n$ is odd, the result is +1 and if $n$ is even the result is -1,…
-2
votes
1 answer

How do I figure out the sequence of a custom Fibonacci sequence?

x=1:1 x=2:2 x=3:3 x=4:6 x=5:9 x=6:15 x=7:25 x=8:39 x=9:63 x=10:99 I've tried using the normal Fibonacci sequence although there were always slight small differences in the numbers. Thanks!
-2
votes
1 answer

Fibonacci in O log(N) with different seeds

This code is a translation from pseudo-code in a mathemathics wiki to resolve Fibonacci problem in O log(n). The problem comes when you want to change the seeds of fibonacci (1,0), this is most mathematical question and complexity question than…
Ratiess
  • 19
1 2 3
11
12