Volume 1

Chapter 1: Basic Concepts: Fibonacci Numbers

The Fibonacci numbers are defined as the sequence:

$F_{0}=1,F_{1}=1,F_{n}=F_{n-1}+F_{n-2}$

The Art of Computer Programming

notes from reading Donald Knuth's Art of Computer Programming

Part of the 2017 CS Study Plan.

Volume 1: Fundamental Algorithms

Mathematical Foundations:

Puzzles/Exercises:

Volume 2: Seminumerical Algorithms

Volume 3: Sorting and Searching

Volume 4: Combinatorial Algorithms

AOCP/Combinatorial Algorithms · AOCP/Boolean Functions

Mathematical Constants

Irrational Numbers: Euler-Mascheroni Constant · Sqrt2 · Phi · Sqrt3 · e · Sqrt5 · Sqrt6 · Sqrt7 · Sqrt8 · Pi · Sqrt10 · 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 ·

Tetration and Knuth's Up Notation: Tetration

Factoring and Number Theory: Divisibility · Totient Function

Games: Four Fours · Five Fives