Editing The Art of Computer Programming (section)

====Volume 2&nbsp;– Seminumerical algorithms====
* Chapter 3&nbsp;– [[Random number]]s
** 3.1. Introduction
** 3.2. [[Pseudo-random number generator|Generating uniform random numbers]]
*** 3.2.1. The [[Linear congruential generator|linear congruential]] method
**** 3.2.1.1. Choice of modulus
**** 3.2.1.2. Choice of multiplier
**** 3.2.1.3. Potency
*** 3.2.2. Other methods
** 3.3. Statistical tests
*** 3.3.1. General test procedures for studying random data
*** 3.3.2. Empirical tests
*** 3.3.3. Theoretical tests
*** 3.3.4. The spectral test
** 3.4. [[Pseudo-random number sampling|Other types of random quantities]]
*** 3.4.1. Numerical distributions
*** 3.4.2. Random sampling and [[Fisher–Yates shuffle|shuffling]]
** 3.5. What Is a [[Random Sequence|random sequence]]?
** 3.6. Summary
* Chapter 4&nbsp;– Arithmetic
** 4.1. [[Positional notation|Positional number systems]]
** 4.2. [[Floating point]] arithmetic
*** 4.2.1. Single-precision calculations
*** 4.2.2. Accuracy of floating point arithmetic
*** 4.2.3. Double-precision calculations
*** 4.2.4. Distribution of floating point numbers
** 4.3. [[Arbitrary-precision arithmetic|Multiple precision arithmetic]]
*** 4.3.1. The classical algorithms
*** 4.3.2. Modular arithmetic
*** 4.3.3. How fast can we multiply?
** 4.4. [[Radix]] conversion
** 4.5. [[Rational number|Rational]] arithmetic
*** 4.5.1. Fractions
*** 4.5.2. The greatest common divisor
*** 4.5.3. Analysis of [[Euclidean algorithm|Euclid's algorithm]]
*** 4.5.4. Factoring into primes
** 4.6. [[Polynomial]] arithmetic
*** 4.6.1. Division of polynomials
*** 4.6.2. Factorization of polynomials
*** 4.6.3. Evaluation of powers ([[addition-chain exponentiation]])
*** 4.6.4. Evaluation of polynomials
** 4.7. Manipulation of [[Power Series|power series]]