## You are here

Homeproof of Cassini's identity

## Primary tabs

# proof of Cassini’s identity

For all positive integers $i$, let $F_{i}$ denote the $i^{{th}}$ Fibonacci number, with $F_{1}=F_{2}=1$. We will show by induction that the identity

$F_{{n+1}}F_{{n-1}}-F_{n}^{2}=(-1)^{n}$ |

holds for all positive integers $n\geq 2$. When $n=2$, we can substitute in the values for $F_{1}$, $F_{2}$ and $F_{{3}}$ yielding the statement $2\times 1-1^{2}=(-1)^{2}$, which is true. Now suppose that the theorem is true when $n=m$, for some integer $m\geq 2$. Recalling the recurrence relation for the Fibonacci numbers, $F_{{i+1}}=F_{i}+F_{{i-1}}$, we have

$\displaystyle F_{{m+2}}F_{m}-F_{{m+1}}^{2}$ | $\displaystyle=$ | $\displaystyle(F_{{m+1}}+F_{m})F_{m}-(F_{m}+F_{{m-1}})^{2}$ | ||

$\displaystyle=$ | $\displaystyle F_{{m+1}}F_{m}+F_{m}^{2}-F_{m}^{2}-2F_{m}F_{{m-1}}-F_{{m-1}}^{2}$ | |||

$\displaystyle=$ | $\displaystyle F_{{m+1}}F_{m}-2F_{m}F_{{m-1}}-F_{{m-1}}^{2}$ | |||

$\displaystyle=$ | $\displaystyle(F_{m}+F_{{m-1}})F_{m}-2F_{m}F_{{m-1}}-F_{{m-1}}^{2}$ | |||

$\displaystyle=$ | $\displaystyle F_{m}^{2}+F_{{m-1}}F_{m}-2F_{m}F_{{m-1}}-F_{{m-1}}^{2}$ | |||

$\displaystyle=$ | $\displaystyle F_{m}^{2}-F_{m}F_{{m-1}}-F_{{m-1}}^{2}$ | |||

$\displaystyle=$ | $\displaystyle F_{m}^{2}-(F_{m}+F_{{m-1}})F_{{m-1}}$ | |||

$\displaystyle=$ | $\displaystyle F_{m}^{2}-F_{{m+1}}F_{{m-1}}$ | |||

$\displaystyle=$ | $\displaystyle-(-1)^{m}$ |

by the induction hypothesis. So we get $F_{{m+2}}F_{m}-F_{{m+1}}^{2}=(-1)^{{m+1}}$, and the result is thus true for $n=m+1$. The theorem now follows by induction.

Related:

CatalansIdentity

Type of Math Object:

Proof

Major Section:

Reference

Groups audience:

## Mathematics Subject Classification

11B39*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Oct 21

new question: Prime numbers out of sequence by Rubens373

Oct 7

new question: Lorenz system by David Bankom

Oct 19

new correction: examples and OEIS sequences by fizzie

Oct 13

new correction: Define Galois correspondence by porton

Oct 7

new correction: Closure properties on languages: DCFL not closed under reversal by babou

new correction: DCFLs are not closed under reversal by petey

Oct 2

new correction: Many corrections by Smarandache

Sep 28

new question: how to contest an entry? by zorba

new question: simple question by parag

new question: Prime numbers out of sequence by Rubens373

Oct 7

new question: Lorenz system by David Bankom

Oct 19

new correction: examples and OEIS sequences by fizzie

Oct 13

new correction: Define Galois correspondence by porton

Oct 7

new correction: Closure properties on languages: DCFL not closed under reversal by babou

new correction: DCFLs are not closed under reversal by petey

Oct 2

new correction: Many corrections by Smarandache

Sep 28

new question: how to contest an entry? by zorba

new question: simple question by parag