\font\tenbxsl=cmbxsl10
\centerline{\bf Errata to {\tenbxsl Mathematics for the Analysis of Algorithms}, third edition}
\centerline{\sl (last updated 26 November 2024)}

\font\manfnt=manfnt
\def\becomes{\ifmmode\ \hbox\fi{\manfnt y}\ } % wiggly arrow indicates a change
\def\bugonpage #1, #2:
  {\medbreak\noindent{\bf Page #1, }#2\par\nobreak\smallskip\noindent}

\bugonpage 1, eq.\ ($\oldstyle1$.$\oldstyle1$):
integer $n$ \becomes integer $n\ge0$

\bugonpage 16, in ($\oldstyle2$.$\oldstyle27$):
$\displaystyle \sum_{k=1}^{n-3}$ \becomes $\displaystyle \sum_{k=0}^{n-3}$

\bugonpage 25, after the theorem:
[Further results on such recurrences have been obtained by T. R. Walsh,
{\sl Information Processing Letters\/ \bf19} (1984), 203--208;
S.~Kapoor and E.~M. Reingold, {\sl J. Math.\ Analysis and Applications\/ 
\bf109} (1985), 591--604.]

\bugonpage 25, in ($\oldstyle2$.$\oldstyle64$):
$A_{h+1}$ \becomes $A_{h+1}(z)$

\bugonpage 26, line 6:
we were lead \becomes we were led

\bugonpage 48, line 2 from the bottom:
in equation ($\oldstyle4$.$\oldstyle22$) \becomes 
in ($\oldstyle4$.$\oldstyle22$)

\bugonpage 77--80, throughout the bibliography:
adding several commas would make the format more consistent

\bugonpage 78, reference [Erd\H{o}s 59]:
385--387 \becomes 290--297

\bugonpage 79, line 25:
{\sl leurs relation \becomes leurs relations}

\bugonpage 80, bottom line:
5(1) \becomes 5(3)

\bugonpage 87, line 7:
(1 \becomes 1

\bugonpage 90, line 8 from the bottom:
0676 \becomes 0739

\bugonpage 94, add a new (one-line) paragraph:
Curiously, (D19) is wrong!

\bugonpage 104, line 14 from the bottom:
$z_1\ldots z_{n-k}$ \becomes $z_2\ldots z_{n-k}$

\bugonpage 106, bottom of page:
[Another solution to this problem, which leads to a generating function,
has been published by P. V. Poblete, {\sl Journal of Algorithms\/ \bf4}
(1983), 388--393.]

\bugonpage 132, line 26 of the right-hand column:
Louis Xavier Joseph \becomes Jean Gustave Nicolas

\bye

