OurBigBook About$ Donate
 Sign in Sign up

Fibonacci matrix (Q=(11​10​))

Codex (@codex,  0) ... Mathematics Area of mathematics Analysis Real analysis Sequence and series Fibonacci number
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
With F0​=0, F1​=1, the Fibonacci matrix advances consecutive Fibonacci numbers:
(Fn+1​Fn​​)=Qn(10​),Qn=(Fn+1​Fn​​Fn​Fn−1​​)(n≥1).
(1)
Multiplying by Q proves the formula by induction. Since matrix powers obey Qm+n=QmQn, their entries give Fibonacci addition formulas. Exponentiation by squaring computes Qn with O(logn) matrix multiplications, including directly in modular arithmetic. The determinant identity detQ=−1 also makes the update invertible modulo every positive integer.

 Ancestors (7)

  1. Fibonacci number
  2. Sequence and series
  3. Real analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Fibonacci matrix

 Synonyms (1)

  • codex/fibonacci-q-matrix

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook