Two notes on notation

  title={Two notes on notation},
  author={Donald Ervin Knuth},
  journal={American Mathematical Monthly},
  • D. Knuth
  • Published 1 May 1992
  • Education
  • American Mathematical Monthly
Mathematical notation evolves like all languages do. As new experiments are made, we sometimes witness the survival of the fittest, sometimes the survival of the most familiar. A healthy conservatism keeps things from changing too rapidly; a healthy radicalism keeps things in tune with new theoretical emphases. Our mathematical language continues to improve, just as "the d-ism of Leibniz overtook the dotage of Newton" in past centuries [4, Chapter 4]. In 1970 I began teaching a class at… 
The Tower of Hanoi - Myths and Maths
This is the first comprehensive monograph on the mathematical theory of the solitaire game The Tower of Hanoi which was invented in the 19th century by the French number theorist douard Lucas and contains a thorough, largely self-contained presentation of the essential mathematical facts with complete proofs.
This is a fine collection of essays on the life and work of Olinde Rodrigues (1795– 1851). Chapter 2 provides an excellent overview, while later chapters are more tightly focused. Although not one of
Mathematical Analysis and the Mathematics of Computation
The real numbers are defined axiomatically, which allows one to define natural numbers, integers, rational numbers, and irrational numbers as well as to derive fundamental properties of these numbers.
Apropos Two Notes on Notation
The best thing that has happened to the Stirling numbers during their 400 years of chequered history is Donald Knuth's paper Two Notes on Notation. The symbol (k ) of von Ettinghausen for the
This edition of this textbook introduces the main principles of computational physics, which include numerical methods and their application to the simulation of physical systems and a discussion of the prevalent methods and a comparison for selected examples.
Scientific Computing in the $C^H$ Programming Language
The extension of C to C to $C^H$ for numerical computation of real numbers, a general-purpose block-structured interpretive programming Ianguage that retains most features of C from the scientific computing point of view is described.
Symbol sense and its development in two computer algebra system environments
It was concluded that the manner of symbolic manipulation may not be a factor inStudents' development of symbol sense and that a laboratory approach to calculus may aid in students' broader development of symbols sense.
Symbolic Analysis for Parallelizing Compilers
operations; in particular, the abstract equalityopcmtion has a key role. Since many compiler optimization problems require the capability of verification or discovery of equality relationship between
Pointfree expression and calculation: from quantification to temporal logic
  • R. Boute
  • Computer Science
    Formal Methods Syst. Des.
  • 2010
Various ramifications, style and abstraction issues are discussed, in relation to engineering mathematics in general and to categorical formulations.
Teaching Ordinal Patterns to a Computer: Efficient Encoding Algorithms Based on the Lehmer Code
Three algorithms for the efficient extraction of ordinal patterns from time series are discussed, including previously published approaches that can be adapted to the Lehmer code, and quantitative measures like permutation entropy and symbolic transfer entropy but also techniques like forbidden pattern identification are discussed.


An Introduction to the Theory of Numbers
This is the fifth edition of a work (first published in 1938) which has become the standard introduction to the subject. The book has grown out of lectures delivered by the authors at Oxford,
A programming language
  • K. Iverson
  • Computer Science
    AIEE-IRE '62 (Spring)
  • 1962
The paper describes a succinct problem-oriented programming language that relies heavily on a systematic extension of a small set of basic operations to vectors, matrices, and trees, and on a family of flexible selection operations controlled by logical vectors.
What Is Enumerative Combinatorics
The basic problem of enumerative combinatorics is that of counting the number of elements of a finite set. Usually are given an infinite class of finite sets S i where i ranges over some index set I
The power of a prime that divides a generalized binomial coefficient.
The main idea is to consider generalized binomial coefficients that are formed from an arbitrary sequence C, as shown in (3) below. We will isolate a property of the sequence C that guarantees the
Note sur les valeurs de la fonction 00x.
Jjes questions de Physique-mathematique dont on s'oceupe de preference depuis quelques annees, ont oblige les geometres a eonsiderer avec plus d'atteiition quon ne Favoit fait jusqu'a present, les
Error bounds for asymptotic expansions of the ratio of two gamma functions
Error bounds are obtained for asymptotic expansions of the ratio of two gamma functions ${{\Gamma (x + a)} / {\Gamma (x + b)}}$ for the case of real, bounded $a,b$ and large positive x. In particular
Singularity Analysis of Generating Functions
This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic
The $q$-Stirling numbers of first and second kinds
Beweis der Gleichung 0° = 1, nach J. F. Pfaff.
V on dieser Gleichung theilte mir mein unvergefslicher Lehrer und Freund, der verst. Hofrath Pf äff in Halle, im Jahre 1814 einen Beweis mit, der an Bündigkeit nichts zu wünschen übrig lassen möchte,
Recherches sur les coefficients des facultés analytiques.
DigiZeitschriften e.V. gewährt ein nicht exklusives, nicht übertragbares, persönliches und beschränktes Recht auf Nutzung dieses Dokuments. Dieses Dokument ist ausschließlich für den persönlichen,