Math 2.0

statement theorem

Cassini's identity

Statement

Let nn be a positive integer, and let FmF_m be the Fibonacci numbers. Then Fn−1Fn+1−Fn2=(−1)n.F_{n-1} F_{n+1} - F_n^2 = (-1)^n.

Remarks

Examples: for n=5n = 5, F4F6−F52=3⋅8−25=−1F_4 F_6 - F_5^2 = 3 \cdot 8 - 25 = -1. For n=6n = 6, F5F7−F62=5⋅13−64=1F_5 F_7 - F_6^2 = 5 \cdot 13 - 64 = 1. A short proof takes determinants in the matrix identity (1110)n=(Fn+1FnFnFn−1)\begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^n = \begin{pmatrix} F_{n+1} & F_n \\ F_n & F_{n-1} \end{pmatrix}. Catalan's identity Fn2−Fn−rFn+r=(−1)n−rFr2F_n^2 - F_{n-r} F_{n+r} = (-1)^{n-r} F_r^2 generalizes it. The case r=1r = 1 is Cassini's identity.

Explanations

L1 human

The product of the two neighbours of a Fibonacci number differs from its square by exactly 11. The sign alternates: 1⋅3−22=−11 \cdot 3 - 2^2 = -1, then 2⋅5−32=12 \cdot 5 - 3^2 = 1, then 3⋅8−52=−13 \cdot 8 - 5^2 = -1.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Fibonacci sequence example
  2. Cassini's identity statement

Sources

  1. Web https://en.wikipedia.org/wiki/Cassini_and_Catalan_identities, lead section