# Tagged Questions

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$.

43 views

### Understanding Fibonacci Proof

I'm trying to show that $$F^2_{k+1} - F^2_k = F_{k-1} * F_{k+2} ∀ ≥1$$ where $$F_k = F_{k-1} + F_{k-2}$$ with $$F_0 = F_1 = 1$$ Let P(n) = $$F^2_{k+1} - F^2_k = F_{k-1} * F_{k+2}$$ Basic Step: ...
83 views

### Trouble with Fibonacci number mathematical induction

The problem is: $$F_n \leqslant 2F_{n-1}\quad\text{for every integer} \quad n \geqslant 2.$$ I got the smallest case, I just don't know how to get the assumption and the rest of it
136 views

### Legitimate papers refuting the significance of the golden ratio in art?

I'm not sure this is the right place to ask about this, but is there any legitimate peer-reviewed paper refuting the significance of the golden ratio in art? I can find numerous websites and blogs ...
65 views

### Number of Fibonacci series that contain a certain integer

In my question, I consider general Fibonacci sequences (sequences satisfying the recurrence relation $F_{n+2}=F_{n+1}+F_n$ independent of their starting value). Given two arbitrary different integers, ...
215 views

### How to find closed form of summation of Fibonacci Sequence?

I created two formulas to prove a binary theory involving the Fibonacci sequence. (1) $\sum_{i=0}^n F_{2i+1}$ Equation (1) is the sum of all Fibonacci numbers up to $F_n$ where every $i$ in $F_i$ ...
106 views

### Fibonacci numeration system

Instead of binary or decimal, the Kingdom of Leutonia uses an unusual system to represent numbers, based on the Fibonacci sequence. The Fibonacci sequence $F_0,F_1,F_2,\dots$ is defined recursively as ...
79 views

### Write out the Leutonian numbers that represent the first 12 positive integers.

How could I write out the leutonian numbers that represent the first 12 positive integers ? I have no idea how to start.
114 views

### determine the number of terms in a fibonacci sequence that are divisible by $3$

Consider the Fibonacci sequence $1, 1, 2, 3, 5, 8, 13, 21, . . .$ where each term, after the first two, is the sum of the two previous terms. How many of the first $1000$ terms are divisible by 3?
182 views

### Question regarding the Fibonacci sequence

Given the Fibonacci sequence $(F_1, F_2,F_3, ...)$ how do I prove that if $m|n$ then $F_m|F_n$? Can this be proven with mathematical induction?
130 views

### Powers of 2 in the product of the Fibonacci numbers

I'm working on finding a summation that pulls the powers of 2 out of the product of the Fibonacci numbers. I've noticed some patterns for the Fibonacci number. For example. Looking at the Fibonacci ...
220 views

### Are the Fibonacci numbers' prevalence in nature due to confirmation bias?

The Fibonacci numbers are frequently found in nature, such as in the petals of flowers or the shape of pinecones. But are the numbers actually any more prevalent than other numbers? Could it all be ...
913 views

### Is there among first $100000001$ Fibonacci numbers one that ends with $0000$?

This looks like a difficult problem: Is there among first $100000001$ Fibonacci numbers one that ends with $0000$? (it is from a competition training; trainer suggests using pigeonhole ...
80 views

77 views

### Fibonacci sequence: Prove the formula $f_{2n+1}=f_{n+1}^2 + f_n^2$ [duplicate]

I can't seem to figure out this proof. I'm using weak induction and always get stuck during the inductive step. Prove for n > 0: $$f_{2n+1} = f_{n+1}^2 + f_n^2$$
175 views

### When do you need to prove more than 1 base case in the Fibonacci problem?

I was trying to prove that if $F_n = F_{n-1} + F_{n-2}$ and $F_1 = 1$ and $F_2 = 1$, then the following proposition $P(n)$ was true $\forall n : \sum^n_{i=1}F_i=F_{n+2} - 1$ The issue I have with the ...
297 views

### Prime number distribution theory for dummies

For the distribution of prime numbers there is a hypothesis which predicts the possible positions of prime numbers called Riemann hypothesis http://en.wikipedia.org/wiki/Riemann_hypothesis#...
34 views

112 views

### Can I use the equality $\phi^2=\phi+1$ without proving it?

I am looking at the following exercise: Show with induction, that the $i^{\rm th}$ Fibonacci number satisfies the equality: $$F_i=\frac{\phi^i-\hat{\phi}^i}{\sqrt{5}}$$ where $\phi$ ...
58 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$.
If we want to compute the nth Fibonacci number we just power the matrix $M = \left[\begin{array}{cc} 1 & 1 \\ 1 & 0 \end{array}\right]$ $n$ times and we get $M =\left[ \begin{array}{cc} F_{n+... 1answer 137 views ### The number of partitions of$n$and the$n$th Fibonacci number. I'm very sorry if this is a duplicate in any way. There's a lot of material out there on connections between these sequences so it's a possibility . . . Let$P_n$be the number of partitions of$n$... 2answers 328 views ### Golden ratio,$n$-bonacci numbers, and radicals of the form$\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\sqrt[n]{\frac{1}{n-1}+\cdots}}}$The following infinite nested radical $$\sqrt{1+\sqrt{1+\sqrt{1+\sqrt{1+\cdots}}}}$$ is known to converge to$\phi=\displaystyle\frac{\sqrt{5}+1}{2}$. It is also known that the similar infinite ... 1answer 68 views ### Fibonacci numbers identity - proof by induction$\displaystyle F_{k-1} F_{k+1} - F_k^2 = (-1)^k$I have done the base step for$k=1$and it works. I realize we need to prove for$k+1\$, so: $$F_k F_{k+2} - F_{k+1}^2 = (-1)^{k+1}$$ Could ...
How do we convert recursive equations into matrix forms? For instance, consider this recursive equation(Fibonacci Series): $$F_n = F_{n-1} + F_{n-2}$$ And it comes out to be that the following that ...