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

Period as a function of n

It is evident from Fibonacci sequence mod(3) $$ 1,1,2,0,2,2,1,0,1,1,2,0,...$$ that every fourth term of the Fibonacci sequence is a multiple of $3$. Similarly for mod(5) $$1,1,2,3,0,3,3,1,4,0,4,4,3,2,0,2,2,4,1,0,1,1,2,....$$ suggests that every…
0
votes
1 answer

Divisibility and the Fibonacci Sequence Proof

Let $F_n$ be the Fibonacci sequence ($F_1=1, F_2=1, F_3=2, \ldots F_n$ such that $F_n = F_{n-1} + F_{n-2}$). Show that $F_n$ divides $F_{rn}$ for all $r,n \ge 1$. I'm not sure how to show this rigorously. I feel that eventually the terms repeat…
0
votes
2 answers

Finding the Fibonacci term from the Fibonacci number

Given that the Fibonacci number is 165580141 Is it possible to find $n$ using the closed form. I tried simplifying the closed form but I get stuck at: $\sqrt5F_n = (\frac{(1+\sqrt5}{2})^n - (\frac{(1+\sqrt5}{2})^n$ $\sqrt5(165580141) +…
stupid
  • 115
  • 6
0
votes
3 answers

How find this sum mod $2017?$

Define Fibonacci Sequence $\{F_{n}\}$ such $$F_{0}=0,F_{1}=1,F_{n+2}=F_{n+1}+F_{n}$$ Find the $$F_{0}+F_{1}+F_{2}+\cdots+F_{2016}\equiv? \pmod {2017}$$ since $2017$ is prime number and $F_{p}\equiv\left(\frac{p}{5}\right) \pmod p$
math110
  • 93,304
0
votes
2 answers

Simplifying Fibonacci Identities

This is very simple, but I am trying to simplify down Fibonacci sequences when doing induction problems, and I am very confused by this. For example, I was trying to simplify $F_n * F_{n+1} + F^2_{n+1})$ down to $F_{n+1} * F_{n+2}$
JanoyCresva
  • 486
  • 7
  • 18
0
votes
1 answer

Generating function for Fibonacci numbers

I tried to follow generating function for Fibonacci numbers proof, which proves this: $$\sum_{n=0}^{\infty} F_{n+2} z^n = \frac{1}{1-(z+z^2)}. $$ Everything seems to be clear, but I still have a question: Does this mean that I can calculate an…
0
votes
2 answers

Equation Involving Fibonacci Numbers

I'm tasked with proving the following equivalency: Let $F_n$ be the Fibonacci number at n, or $F_n = F_{n-1}+F_{n-2}, n >=2$ Show that: $$\frac{1}{F_nF_{n+2}}=\frac{1}{F_nF_{n+1}}-\frac{1}{F_{n+1}F_{n+2}}$$ I tried filling in the definition $F_n$…
user3776749
  • 555
  • 5
  • 16
0
votes
2 answers

How to reduce the complexity of calculating the following summation?

Possible Duplicate: Summation of series of product of Fibonacci numbers Find $$\sum_{i=1}^{N-1}F_{i + 1} F_{N + 4 - i}$$ Is there a direct formula to calculate this, rather than actually sum all the terms? EDIT: My initial summation was…
0
votes
1 answer

Doubt in a property of the Fibonacci Series.

I came across this question in a book where they asked me to prove that there are exactly four terms such that $F_{F_n}= F_n$. Well, I think that this is false and that there are exactly three. I have proof for my statement. Please tell me whether…
0
votes
1 answer

Fibonacci numbers and proving using mathematical induction

I need to prove the rule below using Mathematical proof by induction but actually I'm stuck in the middle of the proving. $$F_n^2 - F_{n-1}F_{n+1} = (-1)^{n+1} {~\rm for~} n>1$$ If someone can help that would be great. Thank you
0
votes
0 answers

Fibonacci Sequence and Time taken

Consider the following (incomplete) java code, which calculates the Fibonacci numbers public int fib(int n){ function++; if(n==0) return 0; if(n==1) return 1; return fib(n-1)+fib(n-2); } Let Step(n) denote the number of function…
0
votes
1 answer

Interesting question on Fibonacci numbers.

Ran across this interesting question about the Fibonacci numbers but quite unsure how to go about it, any ideas ?
TedMosby
  • 503
0
votes
1 answer

Fibonacci n-step numbers

I have searched the web for a definition and I found that this are typically defined as $F^n_{m} = F^n_{m-1} + F^n_{m-2} + \dots + F^n_{m-n}$ where $n$ stands for the number of previous numbers who are added up, and $m$ the mth number who has to be…
Rogelio
  • 75
0
votes
1 answer

Need help calculating probability...

First time here, so I hope you'll not get too frustrated if I make any etiquette mistakes for this forum. So here's my question. I know there are snow day calculators out there, but I'm trying to create my own for an application I'm building for my…
0
votes
1 answer

Fibonacci Sequence Squared

I have been learning about the Fibonacci Numbers and I have been given the task to research on it. I have been assigned to decribe the relationship between the photo (attached below). I know that the relationship is that the "sum of the squares of…
J. Doe
  • 1
1 2 3
11
12