Collection of sources; individual chapter authors and dates are recorded below.

Publisher: Elsevier B.V..

By Peter J. Cameron, D. A. Preece.

Online text: maths.qmul.ac.uk/~pjc/csgnotes/lambda.pdf

Cited passages: Notes on primitive lambda-roots, Section 5, pp. 7–8, definition; Section 5, p. 8, Proposition 5.1(a–c).

By Bruce Ikenaga.

Publication information: sites.millersville.edu/bikenaga/index.html

Online text: sites.millersville.edu/bikenaga/number-theory/wilson-fermat/wilson-fermat.html

Cited passages: Wilson theorem proof and preceding self-inverse lemma; Wilson's Theorem and Fermat's Theorem, Wilson theorem statement.

By Claude Shannon.

Publication metadata: ieeexplore.ieee.org/document/5311476

Online text: ee.stanford.edu/~gray/itss11.pdf

Published in the Institute of Radio Engineers International Convention Record, volume 7 (1959). The introductory summary fixes a nonnegative letter-reconstruction cost and an allowed average distortion, then studies the equivalent source rate.

Collection of sources; individual chapter authors and dates are recorded below.

Collection of sources; individual chapter authors and dates are recorded below.

Publisher: SIAM.

By Rick Durrett. The author-hosted PDF title page identifies Version 5, January 11, 2019; the preface describes the fifth edition.

Online text: sites.math.duke.edu/~rtd/PTE/PTE5_011119.pdf

Cited passages: Probability: Theory and Examples (fifth edition), PDF title page (PDF p. 1): title, whole-book author, Version 5 January 11, 2019, and copyright; Preface (PDF p. 3): fifth edition identification; §2.5 Convergence of Random Series, printed p. 81 (PDF p. 89): tail sigma-field definition and Examples 2.5.1–2.5.2; Theorem 2.5.3 and proof steps (a)–(b), printed pp. 81–82 (PDF pp. 89–90).

Additional cited passages: §3.3.1 definition, printed p. 125; Theorem 3.3.1(a)–(d) and proof, and Theorem 3.3.2 and proof, printed p. 126; §3.3.3, Theorem 3.3.18, printed p. 134.

By Scott Sheffield, as credited on the PDF title slide. No date is assigned from the URL alone.

Online text: math.mit.edu/~sheffield/2016175/Lecture16.pdf

Cited passages: PDF pp. 4–8 define conditional expectation and its uniqueness up to almost surely equality; pp. 9–11 discuss integrability and uniqueness.

By Ben Lynn.

Online text: xenon.stanford.edu/~blynn/pr/symbol.html

Cited passages: Ben Lynn, Symbol Codes, Huffman section: leaf exchanges and reduction to a composite symbol; Ben Lynn, Symbol Codes, Huffman section: the identity L(C,X)=L(C',X')+p0+p1 and the replacement-code contradiction; Ben Lynn, Symbol Codes: expected-length definition and Huffman section.

By David A. Huffman.

Published in Proceedings of the IRE.

Online text: cs.nyu.edu/home/people/in_memoriam/roweis/csc310-2006/extras/huffman_1952_minimum-redundancy-codes.pdf

Cited passages: David A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, p. 1099, Derived Coding Requirements: equal-probability messages may have unequal lengths and may exchange codes without changing the mean; David A. Huffman, A Method for the Construction of Minimum-Redundancy Codes, p. 1099: Derived Coding Requirements and Optimum Binary Code.

By Keith Conrad.

Online text: kconrad.math.uconn.edu/blurbs/ugradnumthy/ordersmodm.pdf

Cited passages: Keith Conrad, Orders of Units in Modular Arithmetic, pp. 7–8, Theorem 4.5 and Remark 4.9.

By Keith Conrad.

Online text: kconrad.math.uconn.edu/blurbs/ugradnumthy/eulerthm.pdf

Cited passages: Keith Conrad, Euler's Theorem, p. 1, Theorem 1.2; pp. 2–3, permutation of the units and cancellation.

By Victor Shoup.

Publisher: Cambridge University Press.

Publication information: shoup.net/ntb/

Online text: shoup.net/ntb/ntb-v2.pdf

Cited passages: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Section 6.5, pp. 156–157, Theorem 6.29; multiplicative notation on p. 153; Victor Shoup, A Computational Introduction to Number Theory and Algebra, second edition, Section 6.5, pp. 153 and 156–157, Theorem 6.29.

By Milan Mossé.

Online text: web.stanford.edu/~marykw/classes/CS250_W19/Netwons_Identities.pdf

Cited passages: §1 pp1–3 statements, historical Girard/Newton account; §4 pp6–8 logarithmic derivative proof; primary authored PDF text inspected.

By Jan Verschelde.

Online text: homepages.math.uic.edu/~jan/mcs563s14/lec12.pdf

Cited passages: Title and date Feb10 2014; §4 p3 Eq15–37, §5 p4 Eq38–42; p3 screenshot inspected.

By Wassily Hoeffding.

Published in Journal of the American Statistical Association, volume 58, issue 301, pp. 13–30.

Online text: doi.org/10.1080/01621459.1963.10500830

Collection of sources; individual chapter authors and dates are recorded below.

Publisher: Stanford University (official CS229 hosting).

By Gilbert Strang.

Publisher: Wellesley-Cambridge Press.

By Tobin A. Driscoll, Richard J. Braun.

Collection of sources; individual chapter authors and dates are recorded below.