AOCP/Fibonacci Numbers: Difference between revisions
From charlesreid1
| Line 12: | Line 12: | ||
F_0 = 1, F_1 = 1, F_n = F_{n-1} + F_{n-2} | F_0 = 1, F_1 = 1, F_n = F_{n-1} + F_{n-2} | ||
</math> | </math> | ||
=Flags= | |||
{{AOCPFlag}} | |||
[[Category:Fibonacci]] | |||
Revision as of 10:26, 20 July 2017
 |
Mathematical Constants
Irrational Numbers: Euler-Mascheroni Constant · Sqrt2 · Phi · Sqrt3 · e · Sqrt5 · Sqrt6 · Sqrt7 · Sqrt8 · Pi · Sqrt10 · Sqrt11 · Pi to the Pi Prime Numbers: Prime Numbers · Palindromic Primes · Prime Generating Polynomials · Belphegors Prime Sequences: Fibonacci Numbers · Lucas Numbers · General Fibonacci Numbers Number Forms: Fermat Numbers · Mersenne Primes · Counting and Combinatorics: Catalan Numbers · Shannon Number · Eddington Number Tetration and Knuth's Up Notation: Tetration Factoring and Number Theory: Divisibility · Totient Function Games: Four Fours · Five Fives
|
Volume 1
Chapter 1: Basic Concepts; Fibonacci Numbers
Fibonacci Numbers: Definition
The Fibonacci numbers are defined as the sequence:
$ F_0 = 1, F_1 = 1, F_n = F_{n-1} + F_{n-2} $
Flags
 |
The Art of Computer Programming notes from reading Donald Knuth's Art of Computer Programming
Part of the 2017 CS Study Plan.
Mathematical Foundations: AOCP/Infinite Series · AOCP/Binomial Coefficients · AOCP/Multinomial Coefficients AOCP/Harmonic Numbers · AOCP/Fibonacci Numbers Puzzles/Exercises:
Volume 2: Seminumerical Algorithms
Volume 3: Sorting and Searching AOCP/Combinatorics · AOCP/Multisets · Rubiks Cube/Permutations
AOCP/Combinatorial Algorithms · AOCP/Boolean Functions AOCP/Five Letter Words · Rubiks Cube/Tuples AOCP/Generating Permutations and Tuples
|