Can we prove this using the Binet's formula for the Fibonacci sequence?

  • MHB
  • Thread starter Chris L T521
  • Start date
In summary, Binet's formula is a mathematical expression that can be used to accurately calculate any term in the Fibonacci sequence. It is based on the golden ratio and has been proven to be a reliable method for finding the sequence's terms. While there are other methods to prove the sequence, Binet's formula is commonly used and can also be applied to other sequences with similar patterns.
  • #1
Chris L T521
Gold Member
MHB
915
0
Thanks to those who participated in last week's POTW! Here's this week's problem!

-----

Problem: One defines the Fibonacci sequence by $F_1=1,\,F_2=1,\,F_{n+2}=F_n+F_{n+1}$ for $n\geq 1$. Show that for all $n\in\mathbb{N}$, $F_{n+1}^2-F_nF_{n+2}=(-1)^n$.

-----

 
Physics news on Phys.org
  • #2
This week's question was correctly answered by:

- caffeinemachine,
- Deveno,
- MarkFL,
- melese,
- Opalg, and
- Sudharaka

Here's caffeinemachine's solution:

Let $P(n)$ denote the statement $F_n^2-F_{n-1}F_{n+1}=(-1)^n$. When $P(n)$ is true we write $P(n)=1$. $P(1),P(2)=1$ can be verified by computation. We assume that $P(1),\ldots,P(n)=1$, where $n\geq 2$. Now we try to establish $P(n+1)=1$.
\begin{align*}
F_{n+1}^2-F_nF_{n+2}&=(F_{n}+F_{n-1})^2-F_nF_{n+2}\\
&=F_n^2+F_{n-1}^2+2F_nF_{n-1}-F_nF_{n+2}\\
&=F_n^2+F_{n-1}^2+2F_nF_{n-1}-F_n(F_{n+1}+F_{n})\\
&=F_n^2+F_{n-1}^2+2F_nF_{n-1}-F_nF_{n+1}-F_{n}^2\\
&=F_{n-1}^2+2F_nF_{n-1}-F_nF_{n+1}\\
&=(-1)^{n-1}+F_{n-2}F_n+2F_nF_{n-1}-F_nF_{n+1}\,\,\,\,(\text{by using P(n-1)=1})\\
&=(-1)^{n-1}+F_{n}(F_{n-2}+F_{n-1})+F_nF_{n-1}-F_nF_{n+1}\\
&=(-1)^{n_1}+F_n^2-F_n(F_{n+1}-F_{n-1})\\
&=(-1)^{n-1}+F_n^2-F_n(F_n)\\
&=(-1)^{n-1}\\
&=(-1)^{n+1}
\end{align*}

This establishes $P(n+1)=1$. By principle of mathematical induction the proof is complete.

Here's Sudharaka's solution (for something different than induction):

Let \(F_n=r^n\) as the trial solution and we get the characteristic equation,\[r^2-r-1=0\Rightarrow r=\frac{1\pm\sqrt{5}}{2}\]
Therefore the general solution is,
\[F_n=A\left(\frac{1+\sqrt{5}}{2}\right)^n+B\left( \frac{1-\sqrt{5}}{2}\right)^n~;~n\in\mathbb{Z}^+\]
where \(A\) and \(B\) are arbitrary constants. Since \(F_1=1\) and \(F_2=1\) we have,
\[A=\frac{1}{\sqrt{5}},B=-\frac{1}{\sqrt{5}}\]
\[\therefore F_n=\frac{1}{\sqrt{5}} \left(\frac{1+\sqrt{5}}{2}\right)^n-\frac{1}{\sqrt{5}} \left( \frac{1-\sqrt{5}}{2}\right)^n~;~n\in\mathbb{Z}^+\]
Now consider \(F^{2}_{n+1}-F_n F_{n+2}\)
\begin{eqnarray}
F^{2}_{n+1}-F_n F_{n+2}&=&F^{2}_{n+1}-F_n(F_n+F_{n+1})\\
&=&\left(F_{n+1}-\left(\frac{1+\sqrt{5}}{2}\right)F_n\right)\left(F_{n+1}-\left(\frac{1-\sqrt{5}}{2}\right)F_n\right)
\end{eqnarray}
Substituting \(F_n=\frac{1}{\sqrt{5}} \left(\frac{1+\sqrt{5}}{2}\right)^n-\frac{1}{\sqrt{5}} \left( \frac{1-\sqrt{5}}{2}\right)^n\) we get,
\[\begin{aligned}&\phantom{=} F^{2}_{n+1}-F_n F_{n+2}\\ &=\left(-\frac{1}{\sqrt{5}} \left( \frac{1-\sqrt{5}}{2}\right)^{n+1}+\frac{1}{\sqrt{5}}\left( \frac{1+\sqrt{5}}{2}\right) \left( \frac{1-\sqrt{5}}{2}\right)^n\right)\left(\frac{1}{\sqrt{5}} \left( \frac{1+\sqrt{5}}{2}\right)^{n+1}-\frac{1}{\sqrt{5}}\left( \frac{1-\sqrt{5}}{2}\right) \left( \frac{1+\sqrt{5}}{2}\right)^n\right)\end{aligned}\]
\[F^{2}_{n+1}-F_n F_{n+2}= \frac{1}{5} (-1)^{n}\left(-\left( \frac{1-\sqrt{5}}{2}\right)+\left(\frac{1+\sqrt{5}}{2} \right) \right) \left(\left(\frac{1+\sqrt{5}}{2} \right)-\left(\frac{1-\sqrt{5}}{2} \right) \right)\]
\[\therefore F^{2}_{n+1}-F_n F_{n+2}= (-1)^n\mbox{ where }n\in\mathbb{Z}^+\]
 

FAQ: Can we prove this using the Binet's formula for the Fibonacci sequence?

How does Binet's formula work for the Fibonacci sequence?

Binet's formula is a mathematical expression that can be used to find any term in the Fibonacci sequence. It states that the nth term in the sequence is equal to the golden ratio raised to the nth power, divided by the square root of 5, plus 1/2. This formula can be used to prove the sequence, as it accurately calculates each term.

Can Binet's formula be used to prove the Fibonacci sequence?

Yes, Binet's formula is a proven method for finding any term in the Fibonacci sequence. It has been used by mathematicians for many years to accurately calculate the sequence, and its accuracy can be tested by plugging in different values for n and observing the corresponding term in the sequence.

How does Binet's formula relate to the golden ratio?

The golden ratio is a mathematical concept that is closely linked to the Fibonacci sequence. It is approximately equal to 1.618 and can be found by dividing any term in the sequence by the previous term. Binet's formula uses the golden ratio to calculate each term in the sequence, making it an important tool in proving the sequence.

Is Binet's formula the only way to prove the Fibonacci sequence?

No, there are other methods to prove the Fibonacci sequence, such as using mathematical induction or a recursive formula. However, Binet's formula is a commonly used and reliable method for proving the sequence, and it has been used by mathematicians for centuries.

Can Binet's formula be applied to other sequences?

Yes, Binet's formula can be applied to other sequences that exhibit similar patterns to the Fibonacci sequence. For example, it can be used to find terms in the Lucas sequence, which is a similar sequence that starts with 2 and 1 instead of 0 and 1. However, it may not work for all sequences, as each sequence may have its own unique formula or method for finding its terms.

Back
Top