% CHANGES TO FASCICLE V4F5 OF THE ART OF COMPUTER PROGRAMMING
%
% Copyright (C) 2019, 2020, 2021, 2022 by Donald E. Knuth
% This file may be freely copied provided that no modifications are made.
% All other rights are reserved.
%
% Three levels of changes to the books are distinguished here:
%
% "\bugonpage" introduces the correction of an error;
% "\amendpage" introduces new material for future editions;
% "\improvepage" introduces ameliorations of lesser importance.
%
% (Changes introduced by \improvepage do not appear in the hardcopy listing.)
%
% Also, "\planforpage" introduces some of the author's half-baked intentions.
%

% NOTE: TO PUT THE INDEX ON A SEPARATE PAGE, RUN THIS WITH THE COMMAND LINE
%   tex "\let\indexeject+ \input err4f5"

\newif\ifall % \alltrue means show the trivial items too
\relax % hook

\def\vertical{|}
\def\inref#1 #{\expandafter\def\csname\vertical#1\endcsname}
\catcode`|=\active
\let|\inref \input \jobname.ref
\catcode`|=12

\input taocpmac % use the format for TAOCP, with modifications below

\def\becomes{\ifmmode\ \hbox\fi{\manfnt y}\ } % wiggly arrow indicates a change

\def\bugonpage#1.#2 #3 (#4) {
  \medbreak\defaultpointsize
  \line{\kern-5pt\llap{\manfnt x}% print a black triangle in left margin
   {\bf Page #2}\enspace #3
   \leaders\hrule\hfill\ \eightrm\date#4.}
  \nobreak\smallskip\iftrue\noindent}
\def\bugoverall#1.#2 #3 (#4) {
  \medbreak\defaultpointsize
  \line{\kern-5pt\llap{\manfnt x}% print a black triangle in left margin
   {\bf Important Changes Throughout!}\enspace
   \leaders\hrule\hfill\ \eightrm\date#4.}
  \nobreak\smallskip\iftrue\noindent}
\def\amendpage#1.#2 #3 (#4) {
  \medbreak\defaultpointsize
  \line{\kern-5pt{\bf Page #2}\enspace #3
   \leaders\hrule\hfill\ \eightrm\date#4.}
  \nobreak\smallskip\iftrue\noindent}
\def\improvepage#1.#2 #3 (#4) {\ifall
  \medbreak\ninepoint
  \line{\kern-6pt{\sl Page #2\enspace #3\/}
   \leaders\hrule\hfill\ \eightrm\date#4.}
  \nobreak\smallskip\noindent}
\def\planforpage#1.#2 #3 (#4) {
  \medbreak\defaultpointsize
  \line{\kern-5pt{\bf Page #2}\enspace #3
   \leaders\hbox to 5pt{\hss.\hss}\hfill\ \eightrm\date#4.}
  \nobreak\smallskip\begingroup\let\endchange=\endgroup\sl\noindent}
\let\endchange=\fi
\def\nl{\par\noindent}
\def\nlh{\par\noindent\hangit}
\def\hangit{\hangindent2em}
\def\cutpar{{\parfillskip=0pt\par}}

\def\date#1.#2.#3.{% convert "yy.mm.dd." to "dd Mon 19yy"
  #3
  \ifcase#2\or Jan\or Feb\or Mar\or Apr\or May\or Jun\or
               Jul\or Aug\or Sep\or Oct\or Nov\or Dec\fi
  \ \ifnum #1<97 \hundred#1\else19#1\fi}
\def\hundred{20} % the "century" for dates before '97

\def\ex #1. [#2]{\ninepoint
  \textindent{\bf#1.}[{\it#2\/}]\kern6pt}
\def\EX #1. [#2]{\ninepoint
  \textindent{\llap{\manfnt x}\bf#1.}[{\it#2\/}]\kern6pt}

\def\foottext#1{\medskip
        \hrule height\ruleht width5pc \kern-\ruleht \kern3pt \eightpoint
        \smallskip\textindent{#1}}
\def\volheadline#1{\line{\hss\cleaders\hbox{\raise3pt\hbox{\manfnt\char'36}}\hfill
       \titlefont\ #1\ \cleaders\hbox{\raise3pt\hbox{\manfnt\char'36}}\hfill\hss}}
\def\refin#1 {\let|\inref \input #1.ref \let|\crossref}

\let\defaultpointsize=\tenpoint

%%%%%%%%%%%%%% opening remarks %%%%%%%%%%%%%%%%%%%%%%%%

\def\lhead{INTRODUCTION}
\let\rhead=\lhead
\titlepage
\volheadline{THE ART OF COMPUTER PROGRAMMING}
\bigskip
\volheadline{ERRATA TO VOLUME 4 FASCICLE 5}
\bigskip

\noindent This document is a transcript of the notes that I have been making
in my personal copy of {\sl The Art of Computer Programming}, Volume~4,
Fascicle~5, since it was first printed in 2019.

\ifall Four levels of updates\dash---``errors,'' ``amendments,'' ``plans,''
   and ``improvements''\dash---appear, indicated by four
\else Three levels of updates\dash---``errors,'' ``amendments,'' and
   ``plans''\dash---appear, indicated by three \fi
different typographic conventions:
\begingroup\def\hundred{17}

\bugonpage 0.666 line 1 (76.07.04)
Technical or typographical errors (aka bugs) are the most critical items, so
they are flagged with a `\thinspace{\manfnt x}\thinspace' preceding the page
number. The date on which I first was told about the bug is shown; this is the
effective date on which I paid the finder's fee. The necessary
corrections are indicated in
a straightforward way. If,~for example, the book says
`$n$' where it should have said `$n+1$', the change is shown thus:
\smallskip
$n$ \becomes $n+1$
\endchange

\amendpage 0.666 line 2 (89.07.14)
Amendments to the text appear in the same format as bugs, but without
the~`\thinspace{\manfnt x}\thinspace'. These are things I wish I had known
about or thought of when I wrote the original text, so I added them later.
The date is the date I drafted the new text.
\endchange

\def\hundred{19}

\planforpage 0.666 line 3 (17.11.20)
Plans for the future represent a third kind of item. In such notes I~sketched
my intentions about things that I wasn't ready to flesh out further when
I~wrote them down. You can identify these items because they're written in
slanted type, and preceded by a bunch of dots
`\hbox to 6em{\leaders\hbox to 5pt{\hss.\hss}\hfill}' leading to the date on
which I recorded the plan in my files.
\endchange

\improvepage 0.666 line 4 (38.01.10)
The fourth and final category\dash---indicated by page and line number in
smaller, slanted type\dash---consists of minor corrections or improvements
that most readers don't want to know about, because they are so trivial.
You wouldn't even
be seeing these items if you hadn't specifically chosen to print the complete
errata list in all its gory details.
Are you sure you wanted to do that?
\endchange

\endgroup
\ifall\else\medskip\ninepoint
My personal file of updates also includes a fourth category of items, not
shown in this list. They are miscellaneous minor corrections or improvements
that most readers don't want to know about, because they are so trivial.
If you really want to see all of the gory details,
you can download the full list from Internet webpage
$$\.{http://www-cs-faculty.stanford.edu/\char`\~knuth/taocp.html}$$
by selecting the ``long form'' of the errata.
\fi

\medskip
\tenpoint
\beginconstruction
The ultimate, glorious, future editions of Volumes 1--5 are works in progress.
Please let me know of any improvements that you think I ought to make.
Send your comments either by snail mail to D.~E. Knuth, Computer
Science, Gates Building 4B, Stanford University, Stanford CA~94305-9045,
or by email to
{\tt taocp{\char`\@}cs.stanford.edu}. (Use email for book suggestions
only, please\dash---all
other correspondence is returned unread to the sender, or discarded,
because I have no time to
read ordinary email.) Although I'm working full time on
Volume~4 these days, I~will try to reply to all such messages
within a year of receipt. Current news about {\sl The Art of Computer
Programming\/} is posted on
$$\.{http://www-cs-faculty.stanford.edu/\char`~knuth/taocp.html}$$
and updated regularly.
\par\endconstruction
\rightline{\dash---Don Knuth, September 2019}

\bigskip
\bigskip
{\quoteformat
In spite of my respect for you, I am not convinced by all of your changes.
\author ERNEST ANSERMET, letter to Igor Stravinsky (28 November 1929)
% Stravinsky in Pictures and Documents, by Stravinsky and Craft (1978) p529

\bigskip
For the first time in many years, I've pulled out a copy
and read a few chapters to see how much my voice may have
changed over time. I confess to wincing every so often at a
poorly chosen word, a mangled sentence, .\thinspace.\thinspace.
I cannot honestly say, however, that the voice in this book is not mine.
\author BARACK OBAMA, {\sl Dreams From My Father\/} (2004)
% preface to the 2004 edition, page ix
\vfill\eject
}

\def\today{\number\day\space\ifcase\month\or
  January\or February\or March\or April\or May\or June\or
  July\or August\or September\or October\or November\or December\fi
  \space\number\year}

%%%%%%%%%%%%%%% CHANGES FOR VOLUME 4 FASCICLE 6 %%%%%%%%%%%%%%%%%%%%%%%%%%%

\def\lhead{CHANGES TO V4F5: MATH PRELIMINARIES, BACKTRACKING ET AL}
\def\rhead{CHANGES TO V4F5: MATH PRELIMINARIES, BACKTRACKING ET AL}
\titlepage
\volheadline{MATH PRELIMINARIES REDUX}   % the fascicle title
\volheadline{INTRO TO BACKTRACKING}      % the fascicle title
\volheadline{DANCING LINKS}              % the fascicle title
\bigskip
\rightline{Copyright \copyright\ 2019, 2020, 2021, 2022
Addison\with Wesley}
\rightline{Last updated \today}
\bigskip
%\rightline{\sl Most of these corrections have already been made in
%                  recent printings.}
%\medskip
%\noindent Important note: The changes below include nearly every difference
%between the paperback fascicle and the first printing of Volume 4A,
%published in January 2011. All subsequent changes can be found in
%the errata list for that volume.

\smallskip
\let\defaultpointsize=\tenpoint

\amendpage 4f5.ii line $-4$ (20.02.10)
\ninepoint\tt
 {\tt www.pearsoned.com/permissions/} \becomes\nl
 {\tt www.pearson.com/permissions/}
\endchange

\amendpage 4f5.iv line 19 (20.02.09)
will solve the \becomes will solve many 
\endchange

\amendpage 4f5.viii new contents item (21.09.18)
\ninepoint
\def\0 #1 |#2|{\line{{#1}\leaders\hbox to
1em{\hfil.\hfil}\hfil\hbox to 1.7em{\hfil#2}}}%
\0 {\tenssbx Breaking News} |384|
\endchange

\improvepage 4f5.4 line $-7$ (21.07.26)
with probability~$q$ \becomes with probability~$q=1-p$
\endchange

\amendpage 4f5.11 line $-6$ (22.06.21)
$=0$. \becomes
$=0$. It's asymptotically almost sure.
\endchange

\improvepage 4f5.13 in exercise {5(b)} (21.02.08)
\ninepoint Suppose $A$ and $B$ \dots\ is odd. \becomes
Suppose the random variable~$A$ takes the values $(m_0,m_2,m_4,\ldots{})$
with probabilities $(q_0,q_2,q_4,\ldots{})$; otherwise $A=0$. Independently,
the random variable~$B$ takes the values $(m_1,m_3,m_5,\ldots{})$
with probabilities $(q_1,q_3,q_5,\ldots{})$; otherwise $B=0$.
\endchange

\amendpage 4f5.14 new rating for exercise 24 (20.10.27)
\ninepoint [{\it\HM27\/}] \becomes [{\it\HM28\/}]
\endchange

\improvepage 4f5.18 line 3 of exercise 63 (20.08.16)
\ninepoint those probabilities \becomes those nine probabilities
\endchange

\amendpage 4f5.19 new rating for exercise 72 (22.06.21)
\ninepoint {\bf72.}\enspace[{\it M21\/}] \becomes\enspace
  {\manfnt x}\kern3pt{\bf72.}\enspace[{\it M23\/}]
\endchange

\bugonpage 4f5.23 line 6 of exercise 112 (20.02.26)
\ninepoint
$\min_{a\in\pi}a\pi=\infty$ \becomes
$\min_{a\in A}a\pi=\infty$
\endchange

\amendpage 4f5.24 line 4 of exercise 121 (21.05.31)
{\it divergence of\/ $Y\!$ from~$X\?$}, \becomes
{\it divergence of\/ $X\!$ from~$Y\!$},
\endchange

\bugonpage 4f5.26 bottom line (21.05.06)
$p_{k-1}\le p_k\ge p_{k-1}$ \becomes
$p_{k-1}\le p_k\ge p_{k+1}$
\endchange

\amendpage 4f5.27 new exercise (21.09.18)
\ninepoint\ex135. [\HM30] ({\it Baxter permutations.})
Let $p_1\ldots p_n$ be a permutation of $\{1,\ldots,n\}$, and let
$q_1\ldots q_n$ be its inverse. These permutations are called Baxter
permutations if and only if
there are no indices $k$ and $l$ with $0<k,l<n$ such that
either ($q_{k+1}<l$ and $q_k>l$ and $p_l<k$ and $p_{l+1}>k$) or
       ($q_k<l$ and $q_{k+1}>l$ and $p_l>k$ and $p_{l+1}<k$).

What's a good way to count the number $b_n$ of $n$-element
Baxter permutations?\tighten
\endchange

\amendpage 4f5.27 new exercise (21.09.26)
\ninepoint
\ex136. [\HM20] Let $f(x)=x\ln x$ be the fundamental convex function
that underlies formulas for entropy. Prove or disprove: If $0\le x\le y\le 1$
then $\vert f(y)-f(x)\vert\le\vert f(y-x)\vert$.
\endchange

\improvepage 4f5.30 line 2 (20.11.14)
level 5 \becomes level 5 below the root.
\endchange

\improvepage 4f5.35 lines $-19$ and $-17$ (20.05.15)
line $-19$: four-letter words \becomes four-letter codewords\nl
line $-17$: from words of the set \becomes from strings of the set
\endchange

\improvepage 4f5.36 lines 2 and 3 (20.05.15)
line 2: Such a word \becomes Such a string\nl
line 3: {\it aperiodic\/} words \becomes {\it aperiodic\/} strings
\endchange

\improvepage 4f5.37 line 15 (20.11.14)
no commafree code \becomes no commafree code of length $(m^4-m^2)/4$
\endchange

\amendpage 4f5.39 new copy for two lines after {\eq(23)} (20.08.16)
\noindent
(This data-structuring technique has been called a {\it sparse-set
representation\/}; see P.~Briggs and L.~Torczon, {\sl ACM Letters
Prog.\ Lang.\ and Syst.\ \bf2} (1993), 59--69.)\tighten
\endchange

\improvepage 4f5.39 line 10 (20.08.16)
codes is not \becomes codes of maximum length is not
\endchange

\bugonpage 4f5.40 line 5 after the table (20.05.30)
$\.{CLOFF}+m^4+cl(\alpha)$. \becomes
$\.{S3OFF}+m^4+s_3(\alpha)$,
$\.{CLOFF}+m^4+4cl(\alpha)$.
\endchange

\bugonpage 4f5.43 line 2 (20.05.30)
we must backtrack \becomes we mustn't proceed
\endchange

\bugonpage 4f5.44 line 2 of step C6 (20.05.30)
$f\gets f-1$ \becomes $f\gets f+1$
\endchange

\bugonpage 4f5.47 line 6 (20.06.05)
$y_1y_2\ldots{}$ \becomes $y_0y_1\ldots{}$
\endchange

\improvepage 4f5.48 line 19 (20.11.14)
shaky grounds \becomes shaky ground
\endchange

\amendpage 4f5.48 line 2 before {\eq(34)} (20.01.19)
P.~Diaconis and S.~Chatterjee \becomes
S.~Chatterjee and P.~Diaconis
\endchange

\amendpage 4f5.48 and 49 (20.01.19)
\eightpoint\noindent
[I'm now using the notation $\widehat\chi_N$ instead of $Q_N$,
for eventual agreement with Section 7.2.2.9]
\endchange

\amendpage 4f5.51 line $-16$ (21.10.27)
a student named \becomes a telegraph engineer named
\endchange

\amendpage 4f5.53 replacement for exercise 15 (21.12.19)
\ninepoint
\ex15. [\HM42] (M. $\?$ Simkin, $\?$2021.) Show that
\begingroup\thickmuskip=5mu minus 3mu
$Q(n)\approx\sigma^n\?n!$ as $n\to\infty$, where $\sigma\approx0.389068$.\tighten\par\endgroup
% Boyd et al showed e^{1-\alpha} to be between .389068024 and .389068152
\endchange

\amendpage 4f5.54 new rating for exercise 19 (20.11.14)
\ninepoint [{\it M19\/}] \becomes [{\it M10\/}]
\endchange

\bugonpage 4f5.55 line 9 of exercise 37 (20.12.22)
\ninepoint
$x_k>x_{k+1}\le x_{k+2}$ \becomes
$x_k\ge x_{k+1}<x_{k+2}$
\endchange

\amendpage 4f5.56 new rating for exercise 46 (20.08.17)
\ninepoint [{\it M30\/}] \becomes [{\it M35\/}]
\endchange

\amendpage 4f5.58 new rating for exercise 69 (19.12.05)
\ninepoint [{\it40\/}] \becomes [{\it41\/}]
\endchange

\bugonpage 4f5.59 in {9(D)} of Table 666 (20.10.24)
\ninepoint $[61\dts67]$ \becomes $[59\dts67]$
\endchange

\amendpage 4f5.60 in lines 4 and 6 of exercise 77 (21.06.01)
\ninepoint $P_3^\to\sqprod P_3^\to$ \becomes
$P\orie_{\!3}\,\sqprod P\orie_{\!3}$
\endchange

\amendpage 4f5.64 line 2 before {\eq(5)} (20.08.17)
find a subset \becomes find all subsets
\endchange

\amendpage 4f5.65, replacement for the third bullet point in {\eq(9)} (20.08.17)
\noindent$$\def\\{$\bullet$\enspace}
\vcenter{
\hbox{\\For each just-deleted option $O$ that involves $i$,
         one at a time, do this:}
\hbox{\indent for each item $j\ne i$ in $O$, cover item $j$; then}
\hbox{\indent recursively append $O$ to each solution of the residual problem.}}
$$
\endchange

\improvepage 4f5.66 just before Table 1 (20.01.01)
are unused. \becomes
are unused and can contain anything.
\endchange

\improvepage 4f5.66 first line of cover$(i)$ (20.01.01)
(Here $p$, $l$, and $r$ are local variables.) \becomes
(Undeclared variables like $p,l,r$ are local.)
\endchange

\improvepage 4f5.71 line 6 (19.11.29)
amendment of \becomes amendment to
\endchange

\improvepage 4f5.78 line 6 before {\eq(37)} (20.11.21)
consecutive letters. \becomes consecutive letters from O to Z.
\endchange

\bugonpage 4f5.84 line 24 (21.06.22)
`$@$\.{4}\enspace\.{000}\enspace\.{011}\enspace\.{111}\enspace
\.{121}\enspace\.{4-}$@$' \becomes
`$@$\.{4}\enspace\.{001}\enspace\.{011}\enspace\.{111}\enspace
\.{121}\enspace\.{4-}$@$'
\endchange

\amendpage 4f5.84 line $-2$ (19.12.21)
Exercises 325--345 \becomes Exercises 324--350
\endchange

\amendpage 4f5.87 line 4 after {\eq(49)} (20.03.27)
never examined. \becomes never examined, except in printouts (see
the answer to exercise 12).
\endchange

\amendpage 4f5.87 line 7 of Table 2 (21.09.19)
\eightpoint
\.{LEN($x$)} \becomes \.{LEN($x$)},\thinspace\.{TOP($x$)}
\endchange

\amendpage 4f5.87 new line for nodes $x=0, 1, 2, 3, 4, 5, 6$ in Table 2 (20.03.27)
\eightpoint
{\def\\{\hbox{---}}\tabskip=6pt plus 1fil
\halign to \hsize{\hfil#:\hfil&&\hfil$#$\cr
\.{COLOR($x$)}&\\&\\&\\&\\&\\&\\& 0\cr
}}
\endchange

\amendpage 4f5.88 in first line of {\eq(55)} (20.03.27)
$q\gets\.{DLINK($i$)}$. \becomes
$\.{COLOR($i$)}\gets c$, $q\gets\.{DLINK($i$)}$.
\endchange

\amendpage 4f5.88 third line of step C5 (20.07.15)
This covers \becomes This commits
\endchange

\amendpage 4f5.88 third line of step C6 (20.07.15)
This uncovers \becomes This uncommits
\endchange

\amendpage 4f5.96 line 1 (20.07.15)
partially covers \becomes commits
\endchange

\amendpage 4f5.96 line 4 of step M7 (20.07.15)
uncovers \becomes uncovers or uncommits
\endchange

\bugonpage 4f5.100 line 9 (22.07.11)
(see exercise 188) \becomes (see exercise 189)
\endchange

\bugonpage 4f5.102 line 6 (21.07.10)
evenually \becomes eventually
\endchange

\bugonpage 4f5.107 line 19 (20.03.07)
`$a$~$g$' and `$a$~$f$'. Further simplifications now arise. \becomes
`$a$~$g$' and `$a$~$f$'.
\endchange

\amendpage 4f5.110 line 1 after {\eq(108)} (21.12.23)
both $\Sigma_1$ and $\Sigma_2$. \becomes
both $\Sigma_1$ and $\Sigma_2$!
\endchange

\bugonpage 4f5.113 line 7 (22.02.26)
belongs of \becomes belongs to
\endchange

\improvepage 4f5.122 last two lines of exercise 2 (20.10.24)
\ninepoint say $(a_1,\ldots,a_k)$, \dots $(a_1,\ldots,a_k)$. \becomes\nl
say $a_1$, \dots,~$a_k$,
then undelete them in exactly the same order $a_1$, \dots, $a_k$.
\endchange

\bugonpage 4f5.126 in exercise 49 (21.08.09)
[the bipartite graph should have an edge between $u_7$ and $v_1$]
\endchange

\amendpage 4f5.127 last sentence of exercise 53 (22.03.21)
\ninepoint Show that \dots\ problems. \becomes
Show that exactly 13 essentially different 4-clue shidoku problems
have a unique solution.
\endchange

\bugonpage 4f5.127 line 1 of exercise 57 (21.09.10)
\ninepoint has 27 \becomes has at most
\endchange

\amendpage 4f5.130 last line of exercise 76 (21.09.19)
\ninepoint an identity element \becomes the identity element 0
\endchange

\amendpage 4f5.130 an additional sentence in exercise 77 (20.03.02)
(In such a case we say that $G$ is {\it embedded\/} in~$H$.)
\endchange

\amendpage 4f5.133 in exercise {103(b) } (22.03.30)
How many solutions \becomes How many inequivalent solutions
\endchange

\amendpage 4f5.135 line 1 of exercise 116 (21.05.25)
\ninepoint
Given a graph on vertices $V$ \becomes
Given a graph $G$ on vertices $V$
\endchange

\amendpage 4f5.135 better illustrations in exercise 116 (20.02.19)
$$\def\\#1{\vcenter{\epsfbox{\figdir/v4b.328#1}}}
M_2\;=\;\\1\,;\qquad
M_3\;=\;\\2\,;\qquad
M_4\;=\;\\3\,;\qquad \ldots\,.$$
\endchange

\bugonpage 4f5.136 in exercise 123 (21.12.23)
\ninepoint line 5: into $m$ parts \becomes into parts\nl
line 6: $+\cdots{n\brace m}m\falling m$ \becomes
           $+\cdots+{n\brace m}m\falling m$
\endchange

\bugonpage 4f5.144 correction to puzzle {(ii)} in exercise 173 (19.12.04)
\ninepoint \dots\ Diagram (ii) shows 8 \dots\ the other 19 can be deduced. \dots
$$\def\epsfsize#1#2{.5#1}\vcenter{\epsfbox{\figdir/v4b.2121}}$$
\endchange

\bugonpage 4f5.144 rewording of exercise 177 (21.11.17)
\ninepoint
\ex177. [M21] Algorithm 7.2.1.5M generates the
$p(n_1,\ldots,n_m)$ partitions of the multiset
$\{n_1\cdot x_1,\ldots,n_m\cdot x_m\}$ into submultisets.
Consider the special cases where $n_1=\cdots=n_s=1$ and
$n_{s+1}=\cdots=n_{s+t}=2$ and $s+t=m$.
\item{a)} Generate those partitions
with Algorithm~M, using the previous two exercises.
\item{b)} Also generate the $q(n_1,\ldots,n_m)$
multipartitions into {\it distinct\/} multisets.
\endchange

\improvepage 4f5.148 in exercise 208 (21.12.19)
\ninepoint
`\.{1a} \.{2a} \.{3a} \.{4a} \.{2b} $V_{\hbox{\seventt 1b}}$' and
`\.{1c} \.{2c} \.{3c} \.{4c} \.{3b} $V_{\hbox{\seventt 1b}}$'
\becomes
`\.{1c} \.{2c} \.{3c} \.{4c} \.{3b} $V_{\hbox{\seventt 1b}}$' and
`\.{1a} \.{2a} \.{3a} \.{4a} \.{2b} $V_{\hbox{\seventt 1b}}$'
\endchange

\amendpage 4f5.150 in exercise 225 (21.12.08)
\ninepoint the $6\times15$ case \becomes the ``one-sided'' $6\times15$ case
\endchange

\bugonpage 4f5.150 in exercise 235 (20.10.18)
\ninepoint costs $\$d(i,j)^4$ \becomes costs $\$4d(i,j)^4$
\endchange

\bugonpage 4f5.152 line 2 of exercise 252 (22.07.25)
\ninepoint \.{ROOT($0$)} \becomes \.{RLINK($0$)}
\endchange

\bugonpage 4f5.155 line 1 of exercise 281 (20.09.02)
\ninepoint $(2n{+}1\times(2n{+}1)$ \becomes $(2n{+}1)\times(2n{+}1)$
\endchange

\improvepage 4f5.155 line 3 of exercise 284 (21.05.25)
\ninepoint (a) $\{I,P,U,V\}$ and (b) $\{F,P,T,U\}$ \becomes
(a) $\{\rm O,P,U,V\}$ and (b) $\{\rm P,R,T,U\}$
\endchange

\bugonpage 4f5.161 replacement for lines 4--6 of exercise 139 (22.02.08)
\ninepoint\noindent
there are
three diaboloes: $\def\\#1#2{\vcenter{\epsfbox{\figdir/v4b.60#1#2}}}
\{@@\\48\,,\\50\!,\\49@\}$. Notice that any $n$-abolo corresponds to
a~\hbox{$2n$-abolo}, when it has been scaled up by~$\sqrt2$.
\endchange

\amendpage 4f5.161 changes to exercise 322 (22.06.07)
\ninepoint For example, \dots\ white. \becomes
For example, there are
two disticks and five tristicks; and of course there's only one monostick.
They're shown here in white, surrounded by
the sixteen tetrasticks in black.\nl
{\eightpoint[And of course there's a new illustration, with colors swapped.]}
\endchange

\bugonpage 4f5.164 in exercise 337 (22.03.17)
\ninepoint line 4: right-handed \becomes left-handed\nl
line 5: left-handed \becomes right-handed
\endchange

\bugonpage 4f5.165 the illustrations in exercise {341(a)} and 345 (21.05.25)
[the darker cubies should be much darker; compare with the colored versions
online in {\tt cs.stanford.edu/\char`\~knuth/fasc5c.ps.gz}, page 103]
\endchange

\amendpage 4f5.169 and 170, replacement for exercise 372 (21.09.10)
\ninepoint \EX372. [M35] ({\it Floorplans}.)
If a rectangle decomposition satisfies the tatami condition\dash---``no
four rectangles meet''\dash---it's often called a {\it floorplan}, and its
subrectangles are called {\it rooms}. The line segments that delimit
rooms are called {\it bounds}. Four possibilities arise when room~$r$
is adjacent to bound~$s$: Either
$s\downarrow r$,
$r\rightarrow s$,
$r\downarrow  s$, or
$s\rightarrow r$, meaning respectively that the top, right, bottom, or
left boundary of~$r$ is part of~$s$.

 For example, the floorplans shown
on the next page have 10 rooms $\rm\{A,B,\ldots,J\}$,
$7+6$ bounds $\{h_0,\ldots,h_6,v_0,\ldots,v_5\}$,
and the following adjacencies:
\def\\#1{\hbox{#1}}%
$h_0\downarrow\\A\downarrow h_3\downarrow\\D\downarrow h_5
  \downarrow\\E\downarrow h_6$,
$h_0\downarrow\\B\downarrow h_1\downarrow\\C\downarrow h_3
  \downarrow\\F\downarrow h_6$,
$h_1\downarrow\\G\downarrow h_2\downarrow\\H\downarrow h_4
  \downarrow\\I\downarrow h_6$,
$h_2\downarrow\\J\downarrow h_6$;
$v_0\rightarrow\\A\rightarrow v_1\rightarrow\\B\rightarrow v_5$,
$v_1\rightarrow\\C\rightarrow v_3\rightarrow\\H\rightarrow v_4$,
$v_0\rightarrow\\D\rightarrow v_2\rightarrow\\F\rightarrow v_3
  \rightarrow\\G\rightarrow v_5$,
$v_0\rightarrow\\E\rightarrow v_2$,
$v_3\rightarrow\\I\rightarrow v_4\rightarrow\\J\rightarrow v_5$.

$$\def\\#1{\vcenter{\epsfbox{\figdir/v4b.372#1}}}
\kern-10pt\\0\quad\\1\quad\\2\quad\\3\kern-10pt$$

Two floorplans with the same adjacencies are considered to be equivalent.
Thus, all four of the floorplans above are essentially the same, even though
they look rather different: In particular, room~C needn't overlap room~D;
we require only $\\C\downarrow h_3\downarrow\\D$.\tighten

\item{a)} Let $r\Downarrow r'$ mean that $r=r_0\downarrow s_0\downarrow r_1
\downarrow\cdots\downarrow s_{k-1}\downarrow r_k=r'$ for some $k>0$;
define $r\Rightarrow r'$ similarly. Prove that
$\[r\Downarrow r']+\[r\Rightarrow r']+\[r'\Downarrow r]+\[r'\Rightarrow r]=1$,
when $r\ne r'$.
\em Hint: Every floorplan has unique diagonal and antidiagonal
equivalents, as shown.\tighten

\begingroup\advance\thickmuskip-1mu
\item{b)} A {\it twin tree\/} is a data structure whose nodes~$v$
have four pointer fields, \.{L0($v$)}, \.{R0($v$)},
\.{L1($v$)}, \.{R1($v$)}. It defines
two binary trees $T_0$ and $T_1$ on the nodes, where
$T_\theta$ is rooted at \.{ROOT$\theta$} and has child links
$(\.{L$\theta$},\.{R$\theta$})$.
These two trees satisfy inorder$(T_0)={\rm inorder}(T_1)=
v_1\ldots v_n$;
$\.{R0($v_k$)}=\Lambda$ $\iff$ $\.{R1($v_k$)}\ne\Lambda$,
for $1\le k<n$.\break\indent
For each room~$r$, if $r$'s top left corner is a
$\top$ junction, set $\.{L0($r$)}\gets\Lambda$ and $\.{L1($r$)}\gets r'$,
where $r'$ is the room opposite~$r$ in that corner; otherwise reverse the
roles of \.{L0} and \.{L1}. Similarly, set $\.{R0($r$)}\gets\Lambda$
and $\.{R1($r$)}\gets r'$ if the bottom right corner of~$r$ is a
$\dashv$ junction, or vice versa otherwise. (Use $r'=\Lambda$ at
extreme corners.) Also set $\.{ROOT0}$ and $\.{ROOT1}$ to the
bottom-left and top-right rooms. Show that a twin tree is created,
convenient for representing this floorplan.\tighten
\par\endgroup
\endchange

\amendpage 4f5.170 and 171, in exercise 375 (20.02.10)
\ninepoint smallest possible perimeter \becomes
smallest possible semiperimeter (height plus width)\nl
smallest perimeter \becomes smallest semiperimeter
\endchange

\amendpage 4f5.172, append new sentence to exercise 387 (20.10.27)
\ninepoint (Note that mirror reflection is {\it not\/} a legal symmetry for a
polycube; L-twist $\ne$ R-twist!)
\endchange

\bugonpage 4f5.180 corrected diagram in exercise 433 (21.05.25)
\noindent$$\def\epsfsize#1#2{.7#1}
\vcenter{\epsfbox{\figdir/v4b.3338}}$$
\endchange

\let\defaultpointsize=\ninepoint % get ready for answer pages

\amendpage 4f5.183 last line of answer 2 (21.08.26)
156.] \becomes A.~Komisarski, {\sl AMM \bf128} (2021), 423--434.]
\endchange

\bugonpage 4f5.185 replacement for lines 3 and 4 of answer 21 (22.07.11)
probability~1/5.
Then $\E XY=\E X=3/5$ and $\E Y=1$; $\Pr(X=0)@\Pr(Y=1)=2/25\ne0$.
\endchange

\amendpage 4f5.185 in answer 24 (20.10.18)
line 2 becomes
$$B'_{m,n}(x)=\sum_{k=1}^m\Bigl({n\atop k}\Bigr)kx^{k-1}(1-x)^{n-k}
         -\sum_{k=0}^m\Bigl({n\atop k}\Bigr)(n-k)x^k(1-x)^{n-1-k}$$
line 7: It suffices \becomes If $a>0$ it suffices\nl
line 12: increases \becomes is nondecreasing
\endchange

\amendpage 4f5.186 last line of answer 24 (22.07.24)
332.] \becomes
332. See also
%S.~Janson, \arXiv:2009.13781 [math.PR] (2020), 12~pages.]
S.~Janson, {\sl Statistics and Probability Letters\/ \bf171} (2021)
109020, 10~pages.]
\endchange

\improvepage 4f5.191 new answer 63 (20.08.16)
\ans63. If $\omega$ is the event `$Z_0=a$ and $Z_1=b$', we have
$Z_0(\omega)=a$ and $\E(Z_1\given
Z_0)(\omega)=\break(p_{a1}+2p_{a2})/(p_{a0}+p_{a1}+p_{a2})$. Hence
$p_{01}=p_{02}=p_{20}=p_{21}=0$, and $p_{10}=p_{12}$. Those conditions are
necessary and sufficient for $\E(Z_1\given Z_0)=Z_0$.
\endchange

\amendpage 4f5.193 first line of answer 72 (22.06.21)
all paths \becomes all paths to $(r,b)$
\endchange

\bugonpage 4f5.194 in answer 83 (20.08.16)
line 2: $\min(m,N)$ \becomes
$N'_n(x_0,\ldots,x_{n-1})=\[n<m]\cdot N_n(x_0,\ldots,x_{n-1})$\nl
line 3: $S_n$ \becomes $S_N$
\endchange

\amendpage 4f5.196 in answer 101 (22.06.09)
By 1.2.10--\eq(25), therefore, and setting $t=\theta/\mu$, \becomes
Set $t=\theta/\mu$, and note that $p_k\ln(1-t/p_k)\ge p\ln(1-t/p)
\ge\smash{1\over\mu}\ln(1-t\mu)={t\over\theta}\ln(1-\theta)$.
By 1.2.10--\eq(25), therefore,
\endchange

\amendpage 4f5.200 lines 7 and 8 of answer 114 (22.01.05)
we could find subsets \dots\ avoids them all \becomes
we could eliminate them one (or more) at a time,
by removing an element from any $S_j$ for which $\vert S_j\vert>d_j+1$
\endchange

\bugonpage 4f5.205 line 4 of answer 133 (22.07.06)
rows, by induction \becomes distinct columns, by induction
\endchange

\amendpage 4f5.205 new answer 135 (21.09.18)
\ansss135, 136, .\thinspace.\thinspace.\thinspace$@$.
 See page 384.
\endchange

\bugonpage 4f5.206 lines 4 and 5 of answer 10 (20.12.22)
$a_l\gets a_{l-1}+t$ \dots\ and \becomes\nl
$a_{l+1}\gets a_l+t$, $b_{l+1}\gets(b_l+t)\rsh1$,
$c_{l+1}\gets((c_l+t)\lsh1)\band\mu$; and
\endchange

\bugonpage 4f5.207 line 2 of answer 12 (20.10.11)
we have also $\sum_{k=1}^n k\equiv{n+1\choose2}$ \becomes
the same sum is also $\equiv{n+1\choose2}$
\endchange

%\amendpage 4f5.207 last line of answer 14 (20.12.22)
%Theorem 2.] \becomes Theorem 2.
%They ask: Does $\lim_{n\to\infty}(\ln Q(n))/(n\ln n)$ exist?
%Is that sequence monotonically increasing, for all sufficiently large~$n$?]
%\endchange

\amendpage 4f5.207 replacement for answer 15 (21.12.19)
%\ans15. See the construction by Z. Luria, \arXiv:1705.05225 [math.CO]
%(2017), 12~pages,~\S2.
\ans15. More precisely, there's a constant $\sigma=e^{1-\alpha}$ such that,
for any fixed $\epsilon$ with $0<\epsilon<\sigma$, $Q(n)/n!$ is q.s.\ between
$((1-\epsilon)@\sigma)^n$ and $((1+\epsilon)@\sigma)^n$.
% the estimate is not great for small n however!
In fact, a subtle analysis [\arXiv:2107.13460 [math.CO] (2021), 51~pages]
shows that the average of all solutions 
approaches a fascinating probability distribution. P.~^{Nobel}, A.~^{Agrawal},
and S.~^{Boyd} have computed $\alpha$ accurately
[\arXiv:2112.03336 [math.CO] (2021), 14~pages].\tighten
\endchange

\bugonpage 4f5.208 line 3 of answer 24 (20.04.22)
word~$x_3$ \becomes word~$x_l$
\endchange

\bugonpage 4f5.211 line 7 of answer 37 (20.12.22)
$b_{e+1}=a_eb_eb_e$ \becomes
$b_{e+1}=b_ea_eb_e$
\endchange

\bugonpage 4f5.211 line 1 of step O3 (20.12.22)
less $(j-1)=1$ \becomes
less$(j-1)=1$
\endchange

\bugonpage 4f5.211 in step O4 (20.12.22)
If $j<t$, set $b'_{t'}\gets b_j$; \becomes
If $i<t$, set $b'_{t'}\gets b_i$;\nl
$b'_0\gets b_{j-t}$ \becomes $b'_0\gets b_{i-t}$
\endchange

\bugonpage 4f5.211 line 3 of step O5 (19.12.18)
while $b_{k-t}<n$ \becomes while $b_{k-t}<2n$
\endchange

\bugonpage 4f5.212 line 2 of answer 38 (20.12.22)
$z_2=j$ \becomes $z_{k-1}=j$
\endchange

\bugonpage 4f5.212 line 1 of answer 44 (20.05.30)
$r\gets m+1$ \becomes $r\gets5$
\endchange

\bugonpage 4f5.213 line $-5$ of answer 45 (20.05.30)
go to C6 \becomes go to C5
\endchange

\amendpage 4f5.213 replacement for last paragraph of answer 46 (21.02.08)
So the answer is ``No.'' But we can come close: Aaron Windsor used a
{\mc SAT} solver in 2021 to discover a binary commafree code for $n=12$
that contains a representative of every cycle class except [000011001011].
\endchange

\bugonpage 4f5.213 line 8 of answer 47 (20.05.30)
1002, 2201, 2001, \becomes
1002, 1102, 2001,
\endchange

\amendpage 4f5.214 replacement for answer 48 (21.02.08)
\ans48. Algorithm C isn't fast enough to solve this problem.
But Aaron Windsor used a {\mc SAT} solver in 2021 to find such a code
of size $139=(5^4-5^2)/4-11$, and to prove that no such code of size 140 exists.
(He also found, rather quickly, that an optimum ternary commafree
code for $n=6$ contains $(3^6-3^3-3^2+3^1)/6-3=113$ codewords.)
\endchange

\amendpage 4f5.217 line $-3$ of answer 61 (21.09.18)
\#R44. \becomes \#R44, 1--16.
\endchange

\bugonpage 4f5.221 line 3 of answer 73 (19.12.12)
\.{roots} \becomes \.{roofs}
\endchange

\bugonpage 4f5.222 line 1 of step R6 (20.05.12)
set $i\gets i_l$ \becomes set $i\gets i_l$, $v\gets v_i$
\endchange

\bugonpage 4f5.222 in step R2' (20.02.05)
$p\ge L$ \becomes $w\ge L$
\endchange

\bugonpage 4f5.223 line 19 (20.04.09)
$(1+3wz^2+2w^2z^3+z^2z^4+w^3z^4)^8$ \becomes
$(1+3wz^2+2w^2z^3+w^2z^4+w^3z^4)^8$
\endchange

\bugonpage 4f5.224 replacement for lines 1--6 of answer 2 (20.10.24)
\ans2. (a) (Solution by X. Lou.) We can prove that
$\.{LLINK($a_k$)}=a_k-1$ and $\.{RLINK($a_k$)}=(a_k+1)\mod(n+1)$
when $a_k$ is undeleted; hence that undeletion sets
\.{RLINK($a_k-1$)} and \.{LLINK($(a_k+1)\mod(n+1)$)} to the correct
value~$a_k$. (If $a_k-1$ wasn't deleted {\it before\/} $a_k$,
\.{LLINK($a_k$)} never changed. Otherwise
\.{LLINK($a_k$)} became $a_k-1$ when $a_k-1$ was undeleted, by
induction on~$k$. A~similar argument works for \.{RLINK}.)
Notice that each \.{LLINK} and \.{RLINK} is reset exactly once, except
that \.{LLINK($1$)} and \.{RLINK($n$)} remain~0.\tighten\par
\endchange

\improvepage 4f5.226 line 2 of answer 12 (21.07.30)
\.{NAME(TOP($q$))} \becomes `$@$\.{NAME(TOP($q$))}$\?\?$'
\endchange

\amendpage 4f5.226 append new paragraph to answer 12 (20.03.27)
[Algorithm C extends Algorithm X to colors. If $\.{COLOR($q$)}\ne0$,
also print `\.{:$c$}' where
$c=\.{COLOR($q$)}$ if $\.{COLOR($q$)}>0$, otherwise $c=\.{COLOR(TOP($q$))}$.]
\endchange

\bugonpage 4f5.229 last line of answer 27 (21.08.06)
5 4 6  10 12 5 \becomes
5 4 6 8 10 12 5
\endchange

\bugonpage 4f5.229 last line of answer 29 (19.12.14)
$\{1,2\}$ \becomes $\{0,1\}$. [Also change
$\vcenter{\baselineskip6pt\sevenrm\halign{#\hfil\cr01\cr10\cr}}$ to
$\vcenter{\baselineskip6pt\sevenrm\halign{#\hfil\cr10\cr01\cr}}$ in
lines 4--5, 9--10, 13--14 of the matrix.]
\endchange

\amendpage 4f5.231 last line of answer 37 (21.03.03)
{\sl Combinatorics}, to appear. \becomes
{\sl Combinatorics\/ \bf27} (2020), \#P1.52, 1--27.
\endchange

\amendpage 4f5.231 replacement for step G3 in answer 38 (21.02.07)

\algindentset{G1}
\algstep G3. [Found?] If $k>n-r$ go to G4.
Otherwise if $a_k=b_{k+n}=c_{k-n}=0$, go to G5.
Otherwise set $k\gets k+1$ and repeat this step.
\endchange

\amendpage 4f5.234 replacement for answer 52 (19.12.14)
\ans52. (Solution by F. Stappers.)
Puzzles claiming to be ``the world's hardest sudoku'' keep appearing in
online forums. Rated by search tree size with Algorithm~X, the toughest
among nearly 27,000 such extreme puzzles
is shown here in a canonical form.
(It's number 6539 in a list available from
{\tt sites.google.com/site/sudoeleven/} (2011).)
% 1000 trials, seeds 314???
Its random\-ized search tree sizes
are $24400\pm1900$\dash---astonishingly
high for sudoku; and its mean running time is about 12~M$\mu$.)
{\hangindent-1in \hangafter0\tighten\parfillskip=0pt\hfil
\def\epsfsize#1#2{.85#1}%
\smash{\rlap{\quad\raise2pt\hbox{\epsfbox{\figdir/v4b.2898}}}}\par}
\endchange

\bugonpage 4f5.236 lines 6 and 7 (21.02.05)
There are only two solutions \dots\ symmetric. \becomes
Include `$\ast_j{:}k$' in option $(0,j,k)$.
There are only four solutions, found in 3~G$\mu$,
centrally symmetric and reducing under transposition to only two.
\endchange

\bugonpage 4f5.237 bottom line (22.06.29)
in the \.{SUDOKU} answer, swap $\.D\swap\.U$ in the top row
\endchange

\bugonpage 4f5.239 last line of answer 70 (21.05.25)
63]; \becomes 63;
\endchange

\bugonpage 4f5.239 line $-3$ of answer 72 (20.07.04)
1292687 packings \becomes 1292697 packings
\endchange

\amendpage 4f5.240 replacement for last line of answer 74 (21.12.18)
\indent [See {\tt www.solitairelaboratory.com/puzzlelaboratory/DominoGG.html}.] 
\endchange

\bugonpage 4f5.241 line 2 of answer 77 (20.03.02)
each pair of vertices \becomes each pair of edges
\endchange

\bugonpage 4f5.241 in the table for answer 80, to match page 87 (20.03.27)
\eightpoint
\.{LEN($x$)} \becomes \.{LEN($x$)},\thinspace\.{TOP($x$)}\nl
[the entries for \.{COLOR($x$)} in nodes $x=6, 11, 16, 19, 22, 25$ should
be zero, not `\hbox{---}'.]
\endchange

\bugonpage 4f5.241 line 2 of answer 83 (20.01.01)
$j>N$ \becomes $j>N_1$
\endchange

\amendpage 4f5.242 line 6 of answer 87 (21.05.25)
items~$w'$ and appending $c_1\ldots c_n{}'$ \becomes
items~$w\@$ and appending $c_1\ldots c_n\!\@$
\endchange

\bugonpage 4f5.243 in answer 90 (21.04.18)
line 12: \.{LOVED}\kern.5pt\.{\char`\|}\kern.5pt\.{GIVES} \becomes
         \.{LOVED}\kern.5pt\.{\char`\|}\kern.5pt\.{GIVEN}\nl
line 13: \.{BONES} \becomes \.{TONES}\qquad and\qquad
         \.{WHILE} \becomes \.{WHOLE}
\endchange

\amendpage 4f5.244 in answer 91 (21.06.06)
line $-8$: the shortest \becomes an optimum\nl
line $-5$: \.{FALLS} \becomes \.{WALLS}
\endchange

\amendpage 4f5.244 line 2 of answer 92 (21.05.25)
$w$, $w'$ \becomes $w$, $w\@$
\endchange

\amendpage 4f5.245 near the top (21.05.25)
line 1: $c_1\ldots c'_n$' \becomes $c_1\ldots c_n\!\@$'\nl
line 3: items $w'$ \becomes items $w\@$
\endchange

\advance\parindent by 4pt % for them BIG answer numbers
\bugonpage 4f5.247 and 248, replacement for first paragraph of answer {103(e)} (22.03.30)
\indent (e) The solution for $n=2$ has every possible symmetry; and both
solutions~$x$ for $n=4$ are equivalent to $x^R$, $-x^Q$, and $-x^{QR}$.
But for $n>4$ one can show that $x$ is equivalent to
at most one of the $4\varphi(n)$
rows $cx$, $cx^R$, $cx^Q$, $cx^{QR}$ besides itself. We obviously can't have
$x\equiv cx$ when $c\ne1$. An elementary but nontrivial proof
shows also that $x\equiv cx^R$ implies $c\mod n=1$; $x\equiv cx^Q$ implies
$c\mod n=n-1$;
$x\equiv cx^{QR}$ implies $c\mod n=n/2+1$ and $n\mod8=4$.
(See Richard Stong in {\sl AMM}, to appear.)
% proposed problem 2428 accepted 2022.06.17, solved by their reviewer Stong
Gilbert stated incorrectly [page~196] that no solutions of the latter
kind exist; he had overlooked 12-tone rows such as
$0\,3\,9\,1\,2\,4\,11\,8\,7\,5\,10\,6$,
$0\,1\,4\,9\,3\,11\,10\,8\,5\,7\,2\,6$,
$0\,1\,8\,11\,10\,3\,9\,5\,7\,4\,2\,6$, for which $x\equiv7x^{QR}$.
Similarly, the 20-tone row
$0\,1\,3\,11\,2\,19\,13\,9\,12\,7\,14\,18\,4\,17\,16\,8\,6\,15\,5\,10$
satisfies $x\equiv11x^{QR}$.)\par
\endchange

\bugonpage 4f5.248 last line of answer 103 (22.03.30)
$5x^{QR}$ \becomes $7x^{QR}$
\endchange

\bugonpage 4f5.248 line 1 of answer 104 (19.12.16)
We may \becomes (a) We may
\endchange

\improvepage 4f5.249 lines 6, 7, 10, 15, 16, 17 of answer 109 (21.05.25)
[enclose each option in single quotes; for example, line 6 should begin with
`$@\#k$ and line 7 should end with $\.0@$']
\endchange

\amendpage 4f5.250 new copy following the displayed solutions
  in answer 109 (21.09.16)
\indent Suppose there are $w$ words of total length~$s$. Aaron~Windsor suggests
adding options `E $ij$:\.. $ij'$:0' for $1\le i\le m$ and $1\le j\le n$,
where E~is a new primary item representing an empty cell. All solutions to
the {\mc MCC} problem with the number of E's in the interval
$[mn-s+w-1\dts mn]$ are then either
connected or contain a cycle.\par
\endchange

\bugonpage 4f5.253 replacement for line $-3$ (21.10.15)
\noindent
$$\def\epsfsize#1#2{.33#1}\vcenter{\epsfbox{\figdir/v4b.2920}}$$\par
\endchange

\bugonpage 4f5.256 line $-5$ (21.10.21)
\.{13:a} or \.{-13:c} \becomes
\.{-13:a} or \.{-13:c}
\endchange

\amendpage 4f5.259 replacement for $Q$ in answer 136, line 16 (20.10.27)
$\displaystyle Q=
{1\over2}\pmatrix{-1&-\phi&1/\phi\cr -\phi&1/\phi&-1\cr1/\phi&-1&-\phi\cr}$
\becomes
$\displaystyle Q=
{1\over2}\pmatrix{1&-\phi&1/\phi\cr \phi&1/\phi&-1\cr1/\phi&1&\phi\cr}$
\endchange

\bugonpage 4f5.260 line 9 of answer 138 (20.07.23)
$96/6=12$ cases \becomes $96/6=16$ cases
\endchange

\bugonpage 4f5.263 line $-4$ of answer 143 (21.10.21)
$(5,1,1,0)$ \becomes $(12,12,1,0)$
\endchange

\bugonpage 4f5.263  line 5 of answer 145 (20.07.24)
3 three odd \becomes 3 odd
\endchange

\bugonpage 4f5.267 line 2 of answer 152 (22.07.22)
multiplicity 11, and without \becomes
multiplicity~11, and a blank pattern of
multiplicity~1, but without
\endchange

\amendpage 4f5.268 updated URL for last line of answer 154 (22.07.11)
{\tt erich-friedman.github.io/mathmagic/0607.html}
\endchange

\bugonpage 4f5.275 line 3 of answer 176 (22.07.11)
`$\#_j B_j$' \becomes
`$\#_j$ $B_j$'
\endchange

\bugonpage 4f5.277 replacement for answer 189{(a)} (19.12.19)
(a) $\vert e^{e^z}\vert=\vert e^{e^x\cos y+ie^x\sin y}\vert=
 \exp(e^x\cos y)$; $\vert e^{-e^z}\vert=\exp(e^{-x}\cos y)$.\par
\endchange

\bugonpage 4f5.278 line 2 of answer 198 (22.07.11)
with $a_j\le s$ \becomes with $a_j\ge s$
\endchange

\amendpage 4f5.280 line $-4$ of answer 207 (20.11.06)
96 G$\mu$, with a 55-meganode \becomes
92 G$\mu$, with a 54-meganode
\endchange

\bugonpage 4f5.280 line 7 of answer 208 (21.11.17)
inserts $V_{i(j-1)}$, $H_{(i+1)j}$, $V_{i(j+1)}$, \becomes
inserts $V_{ij}$, $H_{(i+1)j}$, $V_{i(j+1)}$, $H_{ij}$
\endchange

\bugonpage 4f5.281 in answer 215 (22.02.17)
line 11 should be: (e) Use only $(i,j,k,l)$ for $k=i+1<\min(j,l)$ and $i$ even.\nl
line 15: $(q-1)(q-3)$ \becomes $(2q)(2q-2)$
\endchange

\bugonpage 4f5.284 replacement for answer 232 (20.10.18)
\def\dol/{$\losup\$$}%
\ans232. No. Algorithm X\dol/ finds 96 solutions of minimum cost \$84;
but the true solution in Fig.~\fig74/(a) actually costs \$86
by this measure. The effects of 16 rounding errors,
each potentially changing the result by nearly~\$1, have
invalidated everything.
[Therefore the author used $\$\lfloor 2^{32}d(i,j)\rfloor$ when
preparing Fig.~\fig74/. This was safe, because the distance between the
first 8 solutions and the 9th was greater than 16\dash---in fact,
{\it much\/} greater, although a difference of only 17 would have been
convincing.]\tighten
\endchange

\bugonpage 4f5.286 in answer 239 (19.11.26)
line 3: cost $\epsilon^i$ \becomes cost $\epsilon^j$\nl
line 9: {\sl Graphs and Algorithm\/} \becomes {\sl Graphs and Algorithms\/}
\endchange

\improvepage 4f5.286 line 8 of answer 239 (19.11.28)
smaller cost $\epsilon^4$ \becomes smaller additional cost $0+\epsilon^4$
\endchange

\bugonpage 4f5.288 line 3 of answer 249 (20.01.26)
Set $l=t=0$. \becomes Set $l\gets t\gets0$.
\endchange

\bugonpage 4f5.288 line 4 of answer 249 (21.12.08)
$p\gets t$, $r\gets1$ \becomes
$p\gets t$, $y\gets0$, $r\gets1$
\endchange

\bugonpage 4f5.290 line 2 of answer {261(b)} (22.07.11)
$S=\{s_1,\ldots,s_k\}$ and $T=\{t_1,\ldots,t_k\}$ \becomes
$S=\{s_1,\ldots,s_m\}$ and $T=\{t_1,\ldots,t_m\}$
\endchange

\bugonpage 4f5.293 lines 1 and 2 (20.08.28)
exact problem \becomes exact cover problem
\endchange

\bugonpage 4f5.294 line 5 of answer 270 (21.12.19)
90 rotated \becomes $90^\circ$-rotated
\endchange

\bugonpage 4f5.294 line 2 of answer 271  (21.12.19)
1152 \becomes 152
\endchange

\bugonpage 4f5.298 line 2 of answer 283 (20.09.02)
365(b) \becomes 282(b)
\endchange

\bugonpage 4f5.301 line 6 needs a 42-cell container (21.12.27)
$\vcenter{\epsfxsize=15pt\epsfbox{\figdir/v4b.3097}}$
\endchange

\amendpage 4f5.302 line $-5$ of answer 298 (21.05.25)
{\sl Supplement\/} (1936) \becomes
{\sl Supplement\/ \bf2},\thinspace16 (February 1936)
\endchange

\improvepage 4f5.303 last paragraph of answer 300 (21.12.28)
line 2: ``shadow'' \becomes ``ghost''\nl
line 8: shadow \becomes ghost\nl
line 15: shadows \becomes ghosts
\endchange

\amendpage 4f5.303 updated URL for last line of answer 300 (21.12.27)
{\tt erich-friedman.github.io/mathmagic/0507.html}
\endchange

\bugonpage 4f5.304 replacement for first paragraph of answer 303 (20.02.06)
\ans303. (a) Represent the tree as a sequence $a_0a_1\ldots a_{2n-1}$ of
nested parentheses; then $a_0$ will match $a_{2n-1}$. The left
boundary of the corresponding parallomino is obtained by mapping each `\.('
into N or~E, according as it is immediately followed by `\.(' or `\.)'.
The right boundary, similarly, maps each `\.)' into N or~E according as it
is immediately {\it preceded\/} by `\.)' or `\.('. For example, if we take
7.2.1.6--\eq(1) and enclose it in an additional pair of parentheses,
the corresponding parallomino is shown below with part~(d).\tighten\par
\endchange

\bugonpage 4f5.304 replacement for lines 6, 7, 8 of part {(b)} (20.01.19)
\noindent $1+1+1+1+2+2+2+2+2+2+2+2+2+1+1$; there's an ``outer''~$G$,
whose $H$ is $yxyGy$, and an ``inner''~$G$, whose $H$ is $xyyxyxxy$.)
Thus we can write $G$ as a continued fraction,\tighten
$$G(w,x,y)=wxy\big/\bigl(1-wx-wy-w^3\?xy/(1-w^2\?x-w^2\?y-w^5\?xy/
   (\,\cdots\,))\bigr).$$
\endchange

\bugonpage 4f5.306 four lines after the first display (21.08.21)
[begin a new paragraph with the answer to part (e)]
\endchange

\amendpage 4f5.307 line 2--4 of answer 308 (22.01.24)
takes $(x,y)\mapsto(x+y,x_{\max}-x)'$ \dots\ nonnegative. \becomes
takes $(x,y)\mapsto(x+y,-x)'$ and $(x,y)'\mapsto(x+y+1,-x)$;
the shape's triangles should be shifted afterwards so that all coordinates are
nonnegative and as small as possible.
\endchange

\amendpage 4f5.312 and many nearby pages (22.06.13)
\em IMPORTANT NOTE: I used two different conventions while writing
the exercises for Section 7.2.2.1 during a period of years. If a
problem has $x$ solutions that are essentially different, but
$x\cdot y$ solutions when symmetry has not been taken into account,
I would sometimes write `$x\cdot y$' solutions, and sometimes `$y\cdot x$'.
From now on I shall try to be consistent, always writing `$y\cdot x$'
when $y$ is the amplification factor (the number of automorphisms divided
by the number of symmetries).
For example, the convex polyabolo shape $(3\times11;2,2,1,1)$ displayed
on line 12 of this page has $2\cdot 236$ solutions, not $236\cdot2$.
This change affects the answers to exercises
290, 305, 306, 309, 313, 316, 317, 319, 320, 328, 329, 330, 332, 333, 338, 339,
and 391; but it leaves the answers of many other exercises unchanged, especially
the earlier ones.
\endchange

\bugonpage 4f5.313 lines $-3$ and $-2$ of answer 322 (21.05.25)
Dawson in the 1940s, \becomes Dawson,
\endchange

\improvepage 4f5.314 line 2 of answer 325 (22.03.11)
have the tee in a fixed position and the claw restricted; \becomes
that restrict the tee and the claw as suggested in the text;
\endchange

\amendpage 4f5.314 line 19 of answer 325 (21.11.11)
Section 7.1.4 \becomes Section 7.1.4.2
\endchange

\amendpage 4f5.314 last lines of answer 325 (21.06.30)
line $-2$: five special \becomes seven special\nl
line $-1$: B5f, R7d \becomes B5f, W4e, W2f, R7d
\endchange

\amendpage 4f5.315 in last paragraph of answer 327 (19.12.22)
Hall (clip, underpass) \becomes Hall (piano, clip, underpass)\nl
Morgan (face, gorilla, smile) \becomes Morgan (piano, face, gorilla, smile)
\endchange

\amendpage 4f5.318 in answer 337 (22.06.07)
[to help clarify the first paragraph, two new illustrations show
the ``rear view'']
$$\def\epsfsize#1#2{.8#1}
\vcenter{\epsfbox{\figdir/v4b.1718}}\qquad
\vcenter{\epsfbox{\figdir/v4b.1719}}$$
\endchange

\amendpage 4f5.318 line $-6$ of answer 337 (19.12.14)
[these illustrations should be darker, I've now thickened the lines]
\endchange

\bugonpage 4f5.322 line 7 (19.12.25)
{\sl Budapestiensis\/} \becomes {\sl Budapestinensis\/}
\endchange

\amendpage 4f5.322 lines $-3$ and $-2$ of answer 346 (19.12.14)
(online 18 June 2018) \becomes {\bf61} (2019), 271--284
\endchange

\amendpage 4f5.322 replacement for line $-2$ of answer 349 (20.10.18)
\noindent
$$\def\epsfsize#1#2{.27#1}
\def\\#1{\vcenter{\epsfbox{\figdir/v4b.72#1}}}
\let\quad=\enspace
\centerline{$\\0\quad\\0\quad\\0\quad\\0\quad\\1\quad\\2\quad\\3\quad
\\4\quad\\5\quad\\6\quad\\7\quad\\8\quad\\8\quad\\8\quad\\8$}$$\par
\endchange

\amendpage 4f5.322 replacement for line $-3$ of answer 350 (20.10.18)
\noindent
$$\def\epsfsize#1#2{.4#1}
\def\\#1{\vcenter{\epsfbox{\figdir/v4b.71#1}}}
\let\quad=\enspace
\\0\quad\\0\quad\\0\quad\\1\quad\\2\quad\\3\quad
\\4\quad\\5\quad\\6\quad\\7\quad\\7\quad\\7$$
\endchange

\bugonpage 4f5.325 line 13 (20.09.25)
planar places \becomes planar pieces
\endchange

\bugonpage 4f5.326 replacement for the display after line 3 of part {(d)} (22.04.14)
\noindent$$\eightpoint
\catcode`\!=\active \let!\relax
\setbox0=\hbox{$
\vcenter{\halign{&\hbox to.5em{\hss$\rm#$\hss}\cr
&&a_2&&a_2&&!&!&&a_1&&&&a_2&&!&!&&&a_1&&a_1&&&&!&!\cr
&c&&&&a_2&!&!&c&&&&&&u_2&!&!&&&&&&&&!&!&&a_1&&u_1\cr
&&d&&d&&!&!&&&&&&&&!&!&c&&&&&&u_2&!&!&c&&&&u_1\cr
&&&&&&!&!&&&d&&u_2&&&!&!&&d&&&&u_2&&!&!&&u_1&&u_1\cr}}\,\,;\enspace
\vcenter{\halign{&\hbox to.5em{\hss$\rm#$\hss}\cr
&&C_2&&c_3&&!&!&&C_2&&&&c_3&&!&!&&&C_2&&c_3&&&&!&!\cr
&c_1&&&&C_3&!&!&c_1&&&&&&C_3&!&!&&&&&&&&!&!&&C_2&&c_3\cr
&&C_1&&c_2&&!&!&&&&&&&&!&!&c_1&&&&&&C_3&!&!&c_1&&&&C_3\cr
&&&&&&!&!&&&C_1&&c_2&&&!&!&&C_1&&&&c_2&&!&!&&C_1&&c_2\cr}}\,\,;\enspace
\vcenter{\halign{&\hbox to.5em{\hss$\rm#$\hss}\cr
&&u_5&&u_3&&!&!&&u_1&&&&u_3&&!&!&&&u_3&&u_3&&&&!&!\cr
&u_5&&&&u_6&!&!&u_1&&&&&&u_6&!&!&&&&&&&&!&!&&u_2&&u_2\cr
&&u_5&&u_5&&!&!&&&&&&&&!&!&u_1&&&&&&u_6&!&!&u_1&&&&u_2\cr
&&&&&&!&!&&&u_4&&u_4&&&!&!&&u_4&&&&u_6&&!&!&&u_4&&u_2\cr}}
$}
\centerline{\rotstart{.9 .9 scale}\copy0\kern-.1\wd0\rotfinish}$$
\endchange

\bugonpage 4f5.326 line 4 of answer 357 (20.09.28)
if and only the \becomes if and only if the
\endchange

\amendpage 4f5.330 and 331, replacement for answer 372 (21.09.18)
\ans372. (a) This fact, and the others noted below, can be proved by
induction on the number of rooms: If the lower right corner of the upper left
room is a $\bot$ junction, we can ``flatten'' and remove that room by bringing
its right bound left; otherwise we can bring its bottom bound up.
All floorplans can be built up by reversing this flattening process.\tighten\par
Let the rooms be $r_1\ldots r_n$ in diagonal order and $r_{p_1}\ldots r_{p_n}$
in antidiagonal order (left to right). Then $r_i\Downarrow r_j$
$\iff$ $i<j$ and $i$ follows~$j$ in the permutation $p=p_1\ldots p_n$;
$r_i\Rightarrow r_j$ $\iff$ $i<j$ and $i$ precedes~$j$ in~$p$. The
number of horizontal bounds is the number of {\it descents\/} in~$p$,
plus~2. The number of vertical bounds is the number of {\it ascents},
plus~2.\tighten\par
(b) Here's the twin tree structure for the example. Notice that its
leftward and rightward chains are the ordered sequences
of rooms adjacent to the bounds.
$$\def\epsfsize#1#2{.6#1}
\def\\#1{\vcenter{\epsfbox{\figdir/v4b.372#1}}}
\\4\qquad\\5$$\par
Every twin tree structure arises in a remarkably simple way:
Let $p=p_1p_2\ldots p_n$ be any permutation of $\{1,2,\ldots,n\}$.
Obtain $T_0$ by inserting $p_1$, $p_2$, \dots,~$p_n$ into an initially empty
binary tree; obtain $T_1$ similarly by inserting $p_n$, \dots, $p_2$, $p_1$.
Those trees can be constructed in linear time (exercise 6.2.2--50);
and it's easy to see that they are twins, both with inorder $12\ldots n$.
Although different permutations can yield the same twin tree,
exactly one {\it Baxter permutation\/} (exercise \MPR--135)
does so; and it can be computed from the twin tree in linear time(!).
Thus there are nice one-to-one correspondences between floorplans, twin trees,
and Baxter permutations.\par
[Floorplans are important in VLSI layout, where rooms
correspond to modules and bounds correspond to channels.
Twin trees were introduced by S.~Dulucq and O.~Guibert in
{\sl Discrete Math.\ \bf157} (1996), 91--106, purely for their combinatorial
interest, then applied to floorplans by B.~Yao, H.~Chen, C.-K.~Cheng,
and R.~Graham in {\sl ACM Trans.\ Design Aut.\ Electronic Syst.\ \bf8}
(2003), 55--80. See also J.~M. Hart, {\sl Int. J. Comp. Inf. Sciences\/ \bf9}
(1980), 307--321;
 H.~Murata, K.~Fujiyoshi, T.~Watanabe,
and Y.~Kajitani, {\sl Proc.\ Asia South Pacific Design Aut.\ Conf.\
\bf2} (1997), 625--633;
E.~Ackerman, G.~Barequet, and R.~Y. Pinter, {\sl Discrete
Applied Mathematics\/ \bf154} (2006), 1674--1684;
and the author's programs
{\mc FLOORPLAN-TO-TWINTREE},
{\mc TWINTREE-TO-BAXTER},
{\mc BAXTER-TO-FLOORPLAN}, available online (2021).]\tighten
\endchange

\amendpage 4f5.332 and 333, in answer 375 (20.02.10)
perimeter \becomes semiperimeter \quad [throughout]
\endchange

\bugonpage 4f5.333 in answer 375{(b)} (20.02.10)
$h_6,h_4)$ \becomes $h_6,h_5)$\qquad [four times]
\endchange

\bugonpage 4f5.333 line 4 of answer 376 (20.02.09)
$d=(w+1)/(w(w+2))$ \becomes $d=(w+2)/((w+1)(w+3))$
\endchange

\improvepage 4f5.333 line 3 of answer 378 (21.08.21)
has a subset \becomes has a finite subset
\endchange

\bugonpage 4f5.334 in answer 379 (21.05.25)
line 2: $h\times(w-2)$ \becomes $5\times(w-2)$\nl
lines 6 and 7: or ($h=5$ and $w$ is odd) or \becomes or
\endchange

\improvepage 4f5.335 line 4 of answer 383 (19.11.30)
dissection, into \becomes
dissection, of a $92\times92\times92$ cube into
\endchange

\amendpage 4f5.336 lines 5 and 8 (21.05.25)
[these illustrations should be darker, I've now thickened the lines]
\endchange

\amendpage 4f5.340 last line of answer 398 (20.03.30)
published by Tatsuo Yano \becomes published by Ryuoh Yano
\endchange

\amendpage 4f5.341 lines 2 and 5 of answer 401 (21.05.25)
[these illustrations should be darker, I've now thickened the lines]
\endchange

\amendpage 4f5.344 replacement for answer 413 (19.12.23)
\ans413. (Solution simplified by R. Molinari.)
Let each record for an item include two new fields \.U and \.V.
The \.U and \.V fields of a secondary item that represents
edge $u\adj v$ will point to the primary items $u$ and~$v$. The \.U and \.V
fields of a primary item that represents vertex~$v$ are renamed \.{MATE}
and \.{INNER}. \.{MATE($v$)} is zero until $v$ first becomes the endpoint
of an edge, after which it points to the other endpoint of the path
fragment containing that edge. \.{INNER($v$)} is nonzero when $v$~lies
within a path fragment.\par
Introduce two new global variables:
Global variable \.F is the current number of fragments. Global variable
\.E is the edge that closed a loop, or zero if there's no loop.\par
For example, suppose two edges currently have color~1, say
$v_1\adj v_2$ and $v_3\adj v_4$. Then we've set
$\.{MATE($v_1$)}\gets v_2$,
$\.{MATE($v_2$)}\gets v_1$,
$\.{MATE($v_3$)}\gets v_4$,
$\.{MATE($v_4$)}\gets v_3$, and $\.F\gets2$.
If now $v_2\adj v_5$ joins the fray, we set
$\.{MATE(MATE($u$))}\gets u$,
$\.{MATE(MATE($v$))}\gets v$, and
$\.{INNER($v_2$)}\gets1$;
but we leave \.{MATE($v_2$)} unchanged.
Subsequent edges to~$v_2$ are rejected.\tighten\par
When the `purify' routine \eq(55) is called to give color~1 to a new edge~$i$,
it will refuse to do~so when \.E is nonzero, because a loop has already
been closed. Furthermore, when $\.E=0$,
it will know that edge~$i$ shouldn't be chosen if
\.{U($i$)} and \.{V($i$)} are mates and $\.F\ne1$,
because that would close a loop disjoint from other fragments.
On the other hand, it {\it will\/} close the loop if $\.F=1$,
also setting $\.E\gets i$.\par
All of these operations are nicely and easily undone
when we need to `unpurify'.
For example, suppose edge~$i$ loses color~1 when $u=\.{U($i$)}$
and $v=\.{V($i$)}$. If $v=\.{MATE($u$)}$, we unclose the loop
(and set $\.E\gets0$) if $i=\.E$;
otherwise we zero the mates and set $\.F\gets\.F-1$.
If $\.{MATE($u$)}\ne\.{MATE($v$)}$, we set
$\.{MATE($u$)}\gets u$,
$\.{MATE($v$)}\gets v$,
$\.{INNER($u$)}\gets\.{INNER($v$)}\gets0$, $\.F\gets\.F+1$.
The case $\.{MATE($u$)}=\.{MATE($v$)}$ is easy too.\par
\em Caution: Algorithm P must be modified so that it never discards redundant
items, when it is used to preprocess a problem for this extension
of Algorithm~C.
\endchange

\amendpage 4f5.346 additional material for answer 416 (21.12.21)
But $\smash{\underline{\beta(2)}}$ remains unknown. \becomes\par\smallskip
The intriguing case of $\smash{\underline{\beta(2)}}$ remains unknown.
Beluhov proved that it is at most $11\over16$, using a construction for
$n=4k$ that's illustrated here for $n=\nobreak12$.
Palmer Mebane has constructed this 2-homogeneous puzzle on an $8\times8$ board
that has only 24 clues [see\break
{\tt puzsq.jp/main/puzzle\char`\_play.php?pid=14178}].%
{\hangindent-11pc\hangafter0 \parfillskip=0pt\hfil\tighten
 \smash{\rlap{\qquad
  \lower1pt\vbox{\def\epsfsize#1#2{.45#1}\epsfbox{\figdir/v4b.1987}}\qquad
  \raise10pt\vbox{\def\epsfsize#1#2{.45#1}\epsfbox{\figdir/v4b.1985}}}}\par}
\endchange

\amendpage 4f5.346 replacement for answer 420 (21.12.20)
\ans420. (Solution by Palmer Mebane.) In any solution, each cell is either
inside or outside the loop. {\sl Lemma: Every\/} \.2 {\sl has exactly two neighbors
inside.} (For if the \.2 is outside, the neighbors opposite its two edges
are inside; otherwise the neighbors opposite its two {\it non\/}edges
are inside.) Let $S$ be the set of cells next to a~\.2. Color each~\.2
alternately red or blue; then each cell of~$S$ is a neighbor of one red~\.2
and one blue~\.2. In particular, that's true for each {\it inside\/} cell
of~$S$. Thus, by the lemma, there are equally many red and blue cells.
But that contradicts $m\mod4=n\mod4=1$!\par
[This exercise is due to N.~Beluhov, who observes that solutions aplenty
exist when $m$ is odd and $n\mod4=3$.]
\endchange

\amendpage 4f5.346 {(originally page 347)} line $-3$ of answer 421 (20.03.30)
by Tatsuo Yano \becomes by Ryuoh Yano
\endchange

\bugonpage 4f5.346 {(originally page 347)} last line of answer 421 (19.12.24)
{\bf89} \becomes {\bf90}
\endchange

\bugonpage 4f5.348 in answer 424 (22.03.30)
lines 1--2 (or 3--4): 93659 signatures that aren't contained in any other.
\becomes 93859 that aren't contained in (or equal to)
the signature of any other loop.\nl
line 6 (or 8): 111010111101011110111011 \becomes 000011000011101110110011
\endchange

\amendpage 4f5.348 replacement for lines 3--5 of answer 425 (19.12.25)
\noindent not.
Solutions for $k=2$ exist for all $n\ge3$; solutions for $k=3$ exist for
all $n\ge4$; solutions for $k=4$, due to B.~S. Ho, exist for all $n\ge5$;
solutions for $k=5$ and $k=6$, due to G.~J.~H. Goh, exist for all $n\ge6$.
(See (xviii)--(xxiv) in Fig.~\fig A--5/.) Goh has also discovered
analogous constructions for $k=7$, 8, 9,~10.
\endchange

\improvepage 4f5.348 lines 4 and 5 of answer 426 (20.03.30)
\setbox1=
\hbox{$\def\epsfsize#1#2{.75#1}\,\vcenter{\epsfbox{\figdir/v4b.951}}\,$}%
\setbox0=
\hbox{$\def\epsfsize#1#2{.75#1}\,\vcenter{\epsfbox{\figdir/v4b.950}}\,$}%
there cannot be three consecutive `\copy1',  nor five
`\copy0's that form an X or~T. \becomes
there cannot be three consecutive `\copy1's.
\endchange

\bugonpage 4f5.349 in Fig.~A--5 (22.03.30)
[flip diagrams (ii) and (iii) vertically, so that their clues are subsets of (i)]
\endchange

\bugonpage 4f5.349 replacement for {(xx), (xxi), (xxii)} in Fig.~A--5 (19.12.24)
\begingroup
\def\epsfsize#1#2{.7#1}%
\noindent\epsfbox{\figdir/v4b.4920}\qquad
         \epsfbox{\figdir/v4b.4921}\qquad
         \epsfbox{\figdir/v4b.4922}
\endgroup
\endchange

\amendpage 4f5.353 last line of answer 438 (21.11.11)
Section 7.1.4 \becomes Section 7.1.4.2
\endchange

\bugonpage 4f5.355 line 14 of answer 445 (19.12.04)
an {\mc MCC problem} \becomes an {\mc MCC} problem
\endchange

\amendpage 4f5.356 three new lines for the end of answer 449 (20.02.07)
\noindent
The current record for largest literary hitori nugget, $12\times5=60$,
was found by
Gary McDonald in September 2019: ``Ruth intimated that, as far as
she could judge, he was a very eligible swain.'' [Charles Dickens,
{\sl Martin Chuzzlewit}.]
\endchange

\amendpage 4f5.359 two new answers for exercise 416 (21.12.21)
\noindent
$$\def\epsfsize#1#2{.45#1}
\vcenter{\epsfbox{\figdir/v4b.1988}}\qquad
\vcenter{\epsfbox{\figdir/v4b.1986}}$$
\endchange

\amendpage 4f5.360 include a missing answer (21.05.25)
\centerline{\def\epsfsize#1#2{.54#1}$\vcenter{\epsfbox{\figdir/v4b.3337}}$\quad
(see answer 431)}
\endchange

\expandafter\ifx\csname indexeject\endcsname\relax\else\vfill\eject\fi
\amendpage 4f5.361 and following (19.09.17)
Miscellaneous changes to the existing index of Volume~4 Fascicle~5
are collected here,
including corrections and amendments to the old entries as well as new entries
that are occasioned by the new material. Thus, the lines of the full index
that have changed serve also as an index to the present document. However,
when a correction or amendment has caused an old index entry to be deleted,
the deletion is usually not indicated.

\input exotic
\begindoublecolumns
\begingroup
\indexformat
\gdef\Uni1.08:{\bitmap24:1.08:}
\hangindent2em
$\implies$: Implies. % 3rd
$\iff$: If and only if. % 3rd
a\period s\period: Asymptotically almost surely, 11--12, 20, 21, 26, 195, 196. % 4th
Ackerman, Eyal ({\heb\Hfn/\Hmm/\Hrr/\Hqq/\Haa/ \Hll/\Hyy/\Hyy/\Haa/}), 331. % 3rd
Agarwal, Akshay Kumar ({\dn a\kern0.1em{\char34}y k\kern-0.4em\char0\kern.45emmAr ag\llap{\char125}vAl}), 207. % 3rd
Ascents of a permutation, 330, 384. % 3rd
Ase, Mitsuhiro (\JC46:48:-2:40% J1604
<c00000000000f01c00000000fffe00000030fffe00000078f03efffffffcf03e7ffffffc%
 f03e00000f00f03e00000f00f03c00000f00f03c00000f00f07800000f00f07000000f00%
 f0e030060f00f0c03c0f0f00f1803fff8f00f3003fff8f00f6003c0f0f00f6003c0f0f00%
 f3803c0f0f00f1c03c0f0f00f0e03c0f0f00f0e03c0f0f00f0703c0f0f00f0783c0f0f00%
 f0783c0f0f00f03c3c0f0f00f03c3c0f0f00f03c3c0f0f00f03c3c0f0f00f03c3fff0f00%
 f03c3fff0f00f03c3c0f0f00f03c18060f00f07c00000f00f7fc00000f00f1f800000f00%
 f0f800000f00f07000000f00f00000000f00f00000000f00f00000000f00f00000000f00%
 f00000000f00f00000001f00f0000007ff00f0000000fe00f00000007e00600000003c00%
 >%% unicode char "963f
\JC48:48:0:40% J3205
<1c003000000c0f003c00001e07c03e03ffff03e03e01ffff01f03c0001e001f03c0003e0%
 00f03c3003c000603c780780000ffffcc7180007fffcee3c00003c00fffe00003c00fffe%
 c00c3c20f03c700e3c70f03c780ffff8f03c3c0ffff8f03c3e0e3c70f03c3e0e3c70f03c%
 3e4e3c70fffc1c4e3c70fffc004e3c70f03c004e3c70f03c004e3c70f03c00ce3c70f03c%
 00ce3c70f03c00ce3c70f03c00cffff0f03c01cffff0fffc01ce3c70fffc018c3c20f03c%
 03803c00f03c03803c00f03c07807f00f03c1f007f80f03cff007fc0f03c7f00fde0f03c%
 3f00fcf0fffc3e01fcf0fffc1e03fcf060181e03bc6000001f073c0010e01f0e3c003878%
 0f9c3c003c3e0fb03c007c1f0fc03c00780f0fc03c01f00f07c03c07e00f0380181f0006%
 >%% unicode char "702c
\JC48:48:0:40% J2487
<000007800000000007c00000000003e00380000003e003e0038003c003f003c003c003f0%
 01f003c003e001fc03c003e000fe03c007c0007e03c00780003f03c00f00003f03c00e00%
 001f03c01c00000f03c03800000f03c07000000603c0e000000003c3c000000003c30000%
 000003c0000c000003c0001effffffffffff7fffffffffff0000f03c00000000f03c0000%
 0000f03c00000000f03c00000000f03c00000000f03c00000000f03c00000000f03c0000%
 0000f03c00000000f03c00000001f03c00000001f03c00000001f03c00000001e03c0000%
 0003e03c00080003e03c000c0007c03c000c0007c03c000e000f803c000f001f003c000f%
 003e003c000f007c003e001f00f8003fffff07e0003fffffffc0001ffffefe00000ffffc%
 >%% unicode char "5149
\JC46:48:-2:40% J3572
<00000c00000000000f00000000000f80000000000f80000004000f00000004000f000000%
 0c000f0000300c000f0000781ffffffffffc1ffffffffffc3c00000000787c0000000078%
 fc00000000f0f8000c0001e0f8000f0003c070000f80038000000f80000000000f000000%
 00000f00000000000f00000003000f00180003c00f003c0003fffffffe0003fffffffe00%
 03c00f003c0003c00f003c0003c00f003c0003c00f003c0003c00f003c0003c00f003c00%
 03c00f003c0003c00f003c0003fffffffc0003fffffffc0003c00f003c0003c00f003c00%
 03c00f003c0003c00f003c0003c00f003c0003c00f003c0003c00f003c0003c00f003c00%
 03fffffffc0003fffffffc0003c000003c0003c000003c0003c000001800018000000000%
 >%% unicode char "5b99
), 346. % 2nd
Asymptotic methods, 11, 12, 16, 26, 53, 145--146, 226, 231, 232. % 3rd
Aztec diamonds, 153, 155, 290. % 3rd
Barequet, Gill ({\heb\Htt/\Hqq/\Hrr/\Hbb/ \Hll/\Hyy/\Hgg/}), 331. % 3rd
Baumert, Leonard Daniel, 52, 221, 371. % 3rd
Baxter, Glen Earl, 384. % 3rd
\sub permutations, 27, 330. % 3rd
Binary trees, 170. % 3rd
Binomial coefficients, 384. % 3rd
Bitwise {\mc AND} ($\band$), 17, 126, 208, 227, 350. % 2nd
Bitwise {\mc OR} ($\bor$), 17, 126. % 2nd
Bounds and rooms, 169--170, 384. % 3rd
Boyce, William Martin, 384. % 3rd
Boyd, Stephen Poythress, 189, 207. % 3rd
Briggs, Preston, 39. % 3rd
Brotchie, Alastair, 245. % 2nd
Bucket elimination, \see Frontier. % 2nd
Chen, Hongyu (\GC73:79:-6:64% G1934
<000000000060000000000000000000780000000000000000007c0000000000000000007f%
 0000000000000000007f80000000e0003800007f80000000f800fc00007f00000000fe01%
 fe0000fe00000000ffffff0000fc00000000ffffff8001f800000000ffffff8001f00000%
 7000fc01ff8003f00000f800fc01ff8007e00001fc00fc01fe000fc00003fe00fc03ffff%
 ffffffffff00fc03f3ffffffffffff80fc03f1ffffffffffff80fc07e0801f8000000000%
 fc07e0003f0000000000fc07c0003f0000000000fc07c0007e0000000000fc0f80007e00%
 00000000fc0f8000fe0e00000000fc0f8000fc0f80000000fc1f0001fc07e0000000fc1f%
 0001fc07f8000000fc1e0003f807f8000000fc3e0003f807f0000000fc3c0007f007e000%
 0000fc3e0007f007e0000000fc1f000ff007e0000000fc0f800fe007e0000000fc07c01f%
 e007e0000000fc07e01fc007e0000000fc03f01f8007e001c000fc01f81f0007e003e000%
 fc00f81f0007e007f000fc00fc7e0007e00ff000fc007ffffffffffff800fc007fffffff%
 fffffc00fc003ffffffffffffc00fc003fbe0007e0000000fc001fdc0007e0000000fc00%
 1fc00007e0000000fc001fc06007e0000000fc001fc0f007e0000000fc000fc0fc07e000%
 0000fc000fc0fe07e0000000fc000fc1ff07e0000000fc000fc1ff07e0000000fc001fc1%
 fe07e0000000fc001f83fc07e1c00000ffffbf83f807e1f00000ffffff07f007e0f80000%
 fc7fff07e007e07e0000fc3ffe0fc007e03f0000fc0ffe1f8007e01fe000fc07fc1f8007%
 e00ff800fc07f83f0007e007fe00fc07f03e0007e003ff00fc04007c0007e001ff00fc00%
 00fc0007e000ff80fc0001f80007e000ff80fc0003f00007e0007f80fc0003e00007e000%
 3f80fc0007c00007e0001f80fc000f800007e0001f80fc001f000007e0000f80fc003e00%
 0007e0000f80fc007c000007e0000780fc00f800ffffe0000000fc01e000ffffe0000000%
 fc03c0001fffe0000000fc07800001ffc0000000fc06000000ffc0000000fc040000007f%
 80000000fc000000007e00000000f8000000007c00000000f8000000002000000000>% uni9648
\JC48:48:0:40% J2508
<000007000000000007800000000003e00000000003e00000030003c00000030003c00000%
 038003c0000c078003c0001e07ffffffffff0fffffffffff0f000000001f1f000000003e%
 1f000e00003c1f000f00003c1e000fc000780c000fc000e000000f80000000000f000000%
 00000f00000c00000f00001effffffffffff7fffffffffff00001e00000000001e000000%
 00003e30000000003c3c000000003c3f00000000781f00000000781e00000000f01e0000%
 0001f01c00000001e03c00000003c03800000007c0780000000f80703000000f00f03c00%
 001e00e01e00003c01c01f00007803c00f8000f0038007c001c007001fe007800e03ffe0%
 3e0f1e7ffff03c0ffffff1f00007fffc01f00007ffc001f00007f00001f00003000000e0%
 >%% unicode char "5b8f
\JC48:48:0:40% J1707
<000003000000000003c00000010003e00000010003e00000038003c0000c038003c0001e%
 07ffffffffff0fffffffffff1f800000003e1f800000003c3f00000000383f0000000070%
 3e00000000601800000000c0000000000c00000000001e0000ffffffff00007fffffff00%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c0000c000003c0001effffffffffff7fffffffffff000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c00000000007c0000000007fc0000000001fc0000000000f800000000007000000%
 >%% unicode char "5b87
), 331. % 3rd
Cheng, Chung-Kuan (\JC46:48:-2:40% J3636
<c00c00700000e01e007c0000ffff003e0000ffff003c0000f01e003c0030f01e003c0078%
 f01ffffffffcf03efffffffcf038003c0000f038003c0000f070803c0200f070c03c0700%
 f0e0ffffff80f1c0ffffff80f300f03c0f00f380f03c0f00f0c0f03c0f00f060f03c0f00%
 f070f03c0f00f030f03c0f00f038ffffff00f038ffffff00f03cf03c0f00f03cf03c0f00%
 f03cf03c0f00f03cf03c0f00f03cf03c0f00f03cf03c0f00f03cffffff00f03cffffff00%
 f03c607c0600f03c00fc0000f3fc00fe0000f1fc00ff0000f0f801ff8000f07001fdc000%
 f00003bde000f00007bcf000f0000f3c7800f0001e3c3e00f0003c3c1f80f000783c1ffc%
 f001f03c0ffcf003e03c07f8f03f803c03f8f03c003c00f0f000003c0000600000180000%
 >%% unicode char "9673
\GC65:79:-8:63% G5448
<0000001e00000000000000001f80000000000000000ff0000000000000000ff000000000%
 0000000fe0000000000000000fc0000000000000000f80000000000000000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000007800%
 f000000f800000fc00fe00000f800001fc007ffffffffffffffe007fffffffffffffff00%
 7fffffffffffffff807e00000f800000fc007e00000f800000fc007e00000f800000fc00%
 7e00000f800000fc007e00000f800000fc007e00000f800000fc007e00000f800000fc00%
 7e00000f800000fc007e00000f800000fc007e00000f800000fc007e00000f800000fc00%
 7e00000f800000fc007e00000f800000fc007e00000f800000fc007e00000f800000fc00%
 7e00000f800000fc007e00000f800000fc007e00000f800000fc007e00000f800000fc00%
 7e00000f800000fc007ffffffffffffffc007ffffffffffffffc007ffffffffffffffc00%
 7e00000f800000fc007e00000f800000fc007e00000f800000fc007e00000f800000fc00%
 fe00000f800000fc00fe00000f800000fc00fe00000f800000fc00fc00000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000000000%
 0000000f80000000000000000f80000000000000000f80000000000000000f8000000000%
 0000000fc0000000000000001fc0000000000000001fc0000000000000001fc000000000%
 0000001fc0000000000000001f80000000000000001f8000000000>%% unicode char "4e2d
\KC
<000000000000000000000000000000000000000000000000000000000000080000000000%
 0000000f000000000000000003c00000000000000001f00000000000400000f000000000%
 00c000007800000c0000c000003000001f0000c000000000003f8000ffffffffffffffc0%
 00ffffffffffffffe001c000000000003c0001c0018000c000700003c001f000fc00e000%
 03c000fe007e0180000f80007800780318001fbf00700070003c001f3ffffffffffffe00%
 1e3fffffffffffff00001800700070000000000000700070000000000000700070000000%
 0000007000700000000003007000780800000003c06000601c00000001e00000003f0000%
 0001ffffffffff80000001ffffffffff80000001ffffffffff00000001e00000001e0000%
 0001e00000001e00000001e00000001e00000001e00000001e00000001fffffffffe0000%
 0001fffffffffe00000001e00000001e00000001e00000001e00000001e00000001e0000%
 0001e00000001e00000001e00000001e00000001fffffffffe00000001fffffffffe0000%
 0001e00000001e00000001e00000001e00000001e00000001e00000001e00000001e0000%
 0001e00000001e00000001fffffffffe00000003fffffffffe00000003fffffffffe0040%
 0003e01c03c01e00c00003e03c03c00000c00000c03803c1c000c00000007803c07000c0%
 0000007003c03c00c0000000f003c01e01c0000000e003c00f01c0000001c003c00781c0%
 000007c003c00381c000001f8001c00003c000003e0001e00003f00000fc0001fffffff0%
 0007f00000ffffffe000ff8000001ffffe000ffe000000000000001fc000000000000000%
 000000000000000000000000000000000000000000000000000000000000000000000000%
>%% Unicode char "5bec
), 331. % 3rd
Chung Graham, Fan Rong King (\JC48:48:0:40% J3065
<01c00000018001f00000078001fc00003fc003fe0001ffe003f8000fff0003fe01fff000%
 07f78000f00007e7c000f00007c3c000f00c0f83e000f01e0f03efffffff1e01e7ffffff%
 1c01c000f00038000000f00030010180f030600381e0f0785fffc1fffffccfffc1fffffc%
 81e001e0f07801e001e0f07801e001e0f07801e001e0f07801e0c1fffff801e1e1fffff8%
 fffff1e0f0787ffff1e0f07801e001e0f07801e001e0f07801e301fffff881e381fffff8%
 e1e3c1e0f07871e3e0c0f03079e7c000f00079e78000f0007de70000f0303de60000f078%
 3dee03fffffc3de8e1fffffc39e38000f00001ff0000f00003fc0000f0003ff80000f000%
 ffe00000f00cff800000f01e7e000fffffff780007ffffff700000000000400000000000%
 >%% Unicode char "937e
\GC74:71:-3:61% G2980
<00000000e0000000000000000001fc000000000000000001ff000000000000000003ff80%
 0000000000000003fe000000000000000007fe000000000000000007ff00000000000000%
 000fe700000000000000000fe780000000000000001fc380000000000000001fc1c00000%
 00000000003f81e0000000000000003f00f0000000000000007f00f800000000000000fe%
 007c00000000000000fe003e00000000000001fc003f00000000000003f8001f80000000%
 000003f0000fc0000000000007e00007f000000000000fc00007f800000000003fc00003%
 fe00000000007f800001ff8000000000ff000000ffc000000001fe0000003ff000000007%
 fc0000001ff80000000ff80000000fff0000001fe0000000e7ffe000003fc0000001f1ff%
 ff80003f00000001f8ffffc0007e00000003fc3fffc000f800000007fe1fff8001f03fff%
 ffffff07ff0003c03fffffffff00fc000f800e007e00000020003e0000007e0000000000%
 f80000007e0000000000f00000007e0000000000400000007e0000000000000000007e00%
 00000000000000007e0000780000000000007e0000fc0000000000007e0000fe00000000%
 00007e0001ff0000000000007e0003ff8000007fffffffffffffc000007fffffffffffff%
 c000001fffffffffffffc000000000007e0000000000000000007e000000000000007000%
 7e001e00000000003c007e003f00000000003e007e003fc0000000001f007e003fc00000%
 00001f007e007fc0000000000f807e007f80000000000fc07e00ff000000000007e07e00%
 ff000000000007e07e01fe000000000003e07e01fc000000000003e07e03f80000000000%
 03e07e03f0000000000003e07e07f0000000000003e07e07e000f000000003c07e0fc001%
 f800000000007e0f8003fc00000000007e1e0007fe00000000007e1c000fff003fffffff%
 ffffffffff801fffffffffffffffff800f000000000000000000>%% Unicode char "91d1
\GC73:74:-4:61% G2328
<000003c0000780000000000003f00007e0000000000001fc0003f8000000000001fe0003%
 f8000000000001fc0003f8000000000001fc0003e0000000000001f00003e00070000000%
 01f00003e000f800000001f00003e001fc00000001f00003e003fe00ffffffffffffffff%
 ff00ffffffffffffffffff803fffffffffffffffff800c0001f00003e0000000000001f0%
 0003e0000000000001f00003e0000000000001f1f003e0000000000001f1fc03e0000000%
 000001f0ff83e0000000000001f07fc3e0000000000001f01fe3e0000000000001f01fe3%
 e0000000000001f00fe7e0000000000003f00fe7e0000000000003f007e7e00000000000%
 03f007e0000070000000000003e00001f8000000000003e00003fc000000000003e00007%
 fe00ffffffffffffffffff007fffffffffffffffff803fffffffffffffffff803c00001f%
 8000000000000000001f8000000000000000001f8000000000000000001f800000000000%
 0000001f8000000000000000001f8000000000000000001f8000000000000000001f8000%
 00e000000000001f800001f800000000003f000003fc00000000003ffffffffe00000000%
 003ffffffffe00000000003ffffffffe00000000003f000003fe00000000007f000003f8%
 00000000007e000003f000000000007e000003f000000000007e000003e00000000000fe%
 000003e00000000000fc000003e00000000001fc000003e00000000001fc000003e00000%
 000003f8000003e00000000003f8000007c00000000007f0000007c00000000007e00000%
 07c0000000000fe0000007c0000000001fc000000fc0000000001fc000000f8000000000%
 3f8000001f80000000007f0000001f8000000001fc0000003f8000000003f80000003f00%
 0000000fe00000007f000000003fc0000fc0fe00000000ff00000ffffe00000003fc0000%
 01fffc0000001ff00000001ff8000000ffc00000000ff0000000f80000000007e0000000%
 8000000000070000000000000000000400000000>%% Unicode char "82b3
\GC73:75:-5:62% G4056
<00000f0000000000000000000fc0000f00000000000007f8000fe0000000000007fc000f%
 f0000000000007fc000fe0000000000007e0000fe001c000000007c0000fc003e0000000%
 07c0000fc007f000000007c0000fc00ff800000007c0000fc01ffc00ffffffffffffffff%
 fe007ffffffffffffffffe00200007c0000fe0000000000007c1800fe0000000000007c1%
 e00fe000000000000fc0f00fe000000000000fc07e0fe000000000000fc03f0fe0000000%
 00000fc01f0fc000000000600fc01f0fc000000000600fc01f0fc003800000600fc01f00%
 0007c000006000001f00000ff000007ffffffffffffff800007ffffffffffffffc0000ff%
 fffffffffffffe0000e000000000000ffe0000e001c00000001ffe0001e003e00000001f%
 e00001e007f0007c003f80000fe00ff8703fc03f00001fe01ffc780ff87c00001fe03ff8%
 fc07fe7000001fc07fe0ff03ff6000001fc0ffc1ff80ffe000000f81ff03ff807fe00000%
 0203fe07ff803ff800000007f80ff7c01ffc0000000fe00ff3e007fc0000003fc01fe1f0%
 03fc0000007f003fc1f801fc000001fc007fc0fc00fc000003f800ff807e007c00000fe0%
 01ff003f803c00000f0003fc001fc01c0000080007f8001fe008000000000ff0000ff800%
 000000001fc00007fc00000000003f800003ff8000000000fe000001fff000000001ff00%
 0001fffe00000003ffffffffffffff000007ffffffffffffff80001fdfffffffffffff80%
 003f9f000000fdfffe0000fe1f000000f8fff80001fc1f000000f83ff00007f01f000000%
 f801e0003fc01f000000f8000000ff001f000000f8000000f0001f000000f80000008000%
 1f000000f800000000001f000000f800000000001f000000f800000000001f000000f800%
 000000001f000000f800000000001f000000f800000000001f000000f800000000001fff%
 fffff800000000001ffffffff800000000003f000000f800000000003f000000f8000000%
 00003f000000f800000000003f000000f800000000003f00000000000000>%% Unicode char "84c9
), 384. % 3rd
Chuzzlewit, Martin, 356. % 2nd
Clique hints, 100, 114, 171. % 4th
Coffin, Stewart Temple, 324. % 3rd
Connected components, 134, 142--143, 151, 162, 167, 244, 248, 250. % 3rd
Convex functions, 4, 8, 16, 20, 27, 189, 194, 195. % 3rd
Cutsets, 344. % 2nd
$d^+(v)$ (out-degree of $v$), 218, 247, 337. % 2nd
Data structures, 30--32, 35, 37--40, 44, 56, 63--67, 94--95, 107, 118, 170. % 3rd
Davis, Horace Chandler, 184. % 3rd
Degree of a node, 45, 103. % 4th
Degree of a vertex, 24. %4th
Descents of a permutation, 330, 384. % 3rd
Determinants, 384. % 3rd
Dickens, Charles John Huffam, 356. % 2nd
Distance, dynamically updating, 57. % 2nd
Dominant nodes, 103, 279. % 4th
Doob, martingales, 9--10, 20, 27, 195. % 4th
Downloadable programs, ii, v, 331. % 3rd
Dulucq, Serge, 331, 384. % 3rd
Embedded graphs, 130. % 3rd
Entropy, 24, 25, 27. % 3rd
$f^\uparrow$ (maximal elements of family~$f$), 353--354. % 2nd
Floorplans, 169--170, 384. % 3rd
Franel, J\'er\^ome, 207. % 2nd
Fujiyoshi, Kunihiro (\JC48:48:0:40% J3803
<0000c00c00000000f00f00000000f80f800c0000f00f001effffffffffff7fffffffffff%
 0000f00f00000000f00f00000000f00600000000600000000c06000c03000f0f3e0f07c0%
 0fff8f8f8fe00fff87cf1f800f0f07ef3e000f0f03ef38000f0f01cf60300f0f000f0078%
 0f0f3ffffffc0f0f1ffffffc0f0f001f60000f0f003e70000fff003e300c0fff007c381e%
 0f0fffffffff0f0f7fffffff0f0f01f00f800f0f03e607c00f0f07c787f80f0f0f07c3ff%
 0f0f1fe7c1ff0f0f39f784ff0fffe0ff8e7f0fff00ff9f1e0f0f007fbf800f0f0037f000%
 1f0f000780001e0f000780001e0f003ff0001e0f03f7be001c0f1fe79f803c0f0fc78fc0%
 380f0f878fe0381f060787e031ff043f83e0707e001f81c0603e000f8000c01c00070000%
 >%% unicode char "85e4
\JC48:48:0:40% J2140
<000003000000000003c00000000003e00000000003e00000000003c00000000003c00000%
 000003c0000c000003c0001effffffffffff7fffffffffff000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c000c0%
 000003c001e00ffffffffff007fffffffff0000000000000000000000000000000000000%
 00000000000000000000000000c00000060000f000000f0000ffffffff8000ffffffff80%
 00f000000f0000f000000f0000f000000f0000f000000f0000f000000f0000f000000f00%
 00f000000f0000f000000f0000f000000f0000f000000f0000f000000f0000f000000f00%
 00ffffffff0000ffffffff0000f000000f0000f000000f0000f000000600006000000000%
 >%% unicode char "5409
\JC45:48:-2:40% J4314
<003800180060003e001e00f0003e001ffff8003c001ffff8003c001e00f0003c001e00f0%
 003c181e00e0003c3c1e01e07ffffe1e01c03ffffe1e03c0003c001e0380003c001e0380%
 003c001e0700003c001e0700003c001e0e00003c001e1c00003c181e3000003c3c1e2000%
 3ffffe1e18001ffffe1e0c00003c001e0600003c001e0600003c001e0300003c001e0380%
 003c001e01c0003c001e01c0003c061e01e0003c0f1e00e0ffffff9e00f07fffff9e00f0%
 003c001e00f8003c001e00f8003c001e00f8003c001e00f8003c001e01f8003c001e03f0%
 003c001e7ff0003c001e0fe00078001e07c00078001e030000f0001e000000f0001e0000%
 01e0001e000003c0001e00000780001e00000f00001e00003c00001e0000f000001e0000%
 >%% unicode char "90a6
\JC48:48:0:40% J4546
<03800000020001e03e00030001f00f8007c000f807e007f0007c03f007e0007c01f80fc0%
 007c01fc0f00003c00fc1e00001800fc1c0000000078301880000000203ce0007ffffffe%
 78003ffffffe7c000003c0003e000003c0003f000003c0001f840003c0000f840003c000%
 0f840003c000070c0003c00000080003c03000180003c07800183ffffffc00181ffffffc%
 00300003c00000700003c00000700003c00000e00003c00001e00003c00001c00003c000%
 03c00003c00007c00003c00c07c00003c01e0fc0ffffffffff807fffffff7f800003c000%
 3f800003c0003f800003c0003f800003c0001f800003c0001f800003c0001f800003c000%
 0fc00003c0000fc00003c0000fc00003c0000fc00003c00007c00003c000078000018000%
 >%% unicode char "6d0b
), 331. % 3rd
Games, 8, 13. % 3rd
Ghost pentominoes, 303. % 3rd
Goh, Jun Herng Gabriel (\GC76:74:-3:60% G4666
<00000000000001c000000000f000000007e0000000007c0000000fe0000000007fffffff%
 fff0000000007ffffffffff8000000007ffffffffff8000000007e00000007e000000000%
 7e00000007e0000000007e00000007e0000000007e00000007e0000000007e00000007e0%
 000000007e00000007e0000000007e00000007e0000000007e00000007e0000000007e00%
 000007e0000000007e00000007e0000000007e00000007e0000000007e00000007e00000%
 00007e00000007e0000000007fffffffffe0000000007fffffffffe0000000007fffffff%
 ffe0000000007e00000007e0000000007e00000007e0000000007e00000007e000000000%
 7e00000007e000000000fc000000001c00000000fc000000003e0000000000000000007f%
 000000000000000000ff8000003fffffffffffffc000001fffffffffffffe000001fffff%
 ffffffffe000000800003f0000000000000000003f0000000000000000003f0000000000%
 000000003f0000000000000000007f0000000000000000007f0000000000000000007f00%
 00000000000000007f0000003800000000007f000000fc00000000007e000001fe000000%
 00007e000003ff003fffffffffffffffff801fffffffffffffffffc01fffffffffffffff%
 ffc008000001fdc00000000000000001f9e00000000000000001f8f00000000000000003%
 f0f80000000000000003f0780000000000000003f07c0000000000000007e03e00000000%
 00000007e03f000000000000000fc01f800000000000001fc00fc00000000000003f8007%
 e00000000000003f0007f00000000000007e0003fc000000000000fe0001ff0000000000%
 01fc0000ffc00000000007f800007ff0000000000fe000001ffe000000003fc000000fff%
 800000007f80000007fff0000001fe00000001fffff00007fc000000007ffff0001ff000%
 0000003fffc0007fc0000000000fff8003ff000000000003fe001ffc0000000000007800%
 fff00000000000001000e0000000000000000000>%% unicode char "5434
\GC79:77:-1:63% G3094
<000000000001e0000000000000000001f8000000000000000003fe000000000000000003%
 fe000000000700000007fc0000000007e0000007f00000000007f800000fe00000000007%
 f800001fc0e000000007f000001f80f000000007e000003f007c00000007e000007e001f%
 80000007e00000fc000fe0000007e00001f80007f0000007e00003f00003fc000007e000%
 07e00001fe000007e0001fc00000ff000007e0007f800000ff000007e007ffffffffff80%
 0007e007ffffffffff803807e1c3fffffffc1fc03e07e1f1ffffff801fc03f87e1f8ffff%
 e0000fc03fe7e1fe7ffc00000fc03fe7e1fe00e0000007c03f87e1fc00f000f006003f07%
 e1f801f801fc00003f07e1f801fc00fe00003f07e1f803fc007f80003f07e1f807f8001f%
 e0003f07e1f80ff0000ff8003f07e1f80fe00007fc003f07e1f81fc00003ff003f07e1f8%
 3f9c0001ff803f07e1f8fe3f8000ffc03f07e1f9fc3fe0007fc03f07e1fbf03fe0003fc0%
 3f07e1ffe07fe0001fc03f07e1ff807f80000fc03f07e1fe007f001c0f803f07e1f800fc%
 001e07003f07e1f800f8003f02003f07e1f801ffffff80003f07e1f801ffffffc0003f07%
 e1f803ffffffe0003f07e1f807f0001fe0003f07e1f807f8003fe0003f07e1f80f78003f%
 00003f07e1f80e7c003e00003f07e1f81c3c003e00003f07e1f8383c007e00003f07e1f8%
 781e007c00003f07e1f9f01e00fc00003f07e1fbf01e00f800003f07e1ffe00f01f80000%
 3f07e1ff800f01f000003f07e3ff000f83f000003f07fff80007cfe000003f0ffdf80007%
 dfe000007ffff1f80003ffc00000ffffc1f80003ff8000007ffe01f80001ff0000003ff0%
 01c00003ff8000001f0001000007ffc0000008000000000ffff0000000000000001ffff8%
 000000000000003feffe000000000000007f83ffc0000000000001ff01fff00000000000%
 07fe00fffe00000000001ff8003ffffc000000007ff0001ffffe0000000fffc00007fffe%
 000000fffe000003fff000001ffff8000000ffc00001ffffe00000001f000001fffc0000%
 000002000001ffc0000000000000>%%  unicode char "5cfb
\GC74:74:-3:61% G2667
<001c0000000000000000001f8000000000000000001fe000000000000000001ff0000000%
 00000000001fe000000000000000001fe00000000000e000001fc00000000001f000001f%
 800000000003fc00001f800000000007fe00001f807fffffffffff00001f803fffffffff%
 ff00001f801c000000000000001f8000000000000000001f8000000000000000001f8000%
 000000000000001f8000000000000000001f8000000000000000001ff001c000003c0000%
 001ffe01f000007e0000001fff81f800007f0000061f9fc1fc0000ff8000061f8ff1ffff%
 ffffc000071f87f1ffffffffc000071f83f8f800007f8000071f83f8f800007f0000071f%
 81f8f800007e0000071f81f8f800007e00000f1f81f0f800007e00000f1f81f0f800007e%
 00000f1f8040f800007e00001f1f8000f800007f00001f1f8000f800007f00007f1f8000%
 f800007f0000ff1f8000f800007f0000ff1f8000f800007f00007f1f8000f800007f0000%
 7f1f8000ffffffff00003c1f8000ffffffff0000001f8000f800007f0000001f8000f800%
 007f0000001f8000f800007f0000001f8000f800007f0000001f8000f800007f0000001f%
 8000f800007f0000001f8000f800007f0000001f8000f800007f0000001f8000f800007f%
 0000001f8000f800007f0000001f8000f800007f0000001f8000f800007f0000001f8000%
 f800007f0000001f8000ffffffff0000001f8000ffffffff0000001f8000ffffffff0000%
 001f8001f800007f0000001f8001f800007f0000001f8001f800007e0000001f8001f800%
 007e0000001f8001f00000000000001f8001f00000000000001f8000000000000000001f%
 8000000000003800001f8000000000007c00001f800000000000fe00001f800000000001%
 ff00001f9fffffffffffff80001f8fffffffffffffc0001f87ffffffffffffc0001f8000%
 000000000000001f8000000000000000001f8000000000000000001f8000000000000000%
 001f8000000000000000001e0000000000000000>%% Unicode char "6052
), 348. % 2nd
Golomb, Solomon Wolf, 35, 52, 77, 78, 82, 155, 221, 294, 310, 371. % 3rd
Graham, Ronald Lewis (\GC72:74:-4:61% G2480
<0000007c000f8000000000007f800ff000000000003fc00ff000000000003f000fc000e0%
 0000003e000fc001f00000003e000fc003f80000003e000fc007f80000003e000fc00ffc%
 3ffffffffffffffffe1fffffffffffffffff0fffffffffffffffff0200003e000fc00000%
 0000003e000fc000000000003e000fc000000000003e000fc000000000f03e000fc78000%
 0000fc7e000fcfe0000000fffffffffff0000000fffffffffff8000000fffffffffff800%
 00007c00000007c00000007c00000007c00000007c00000007c00000007c00000007c000%
 00007c00000007c00000007c00000007c00000007fffffffffc00000007fffffffffc000%
 00007c00000007e00000007c00000007e00000007c00000007e00000007c00000007e000%
 00007c00000007e00000007c00000007e00000007fffffffffe0000000ffffffffffe000%
 0000fc1fe00007e0000000fc3fc00007e0000000fc7f800007c0000000fcff00000003c0%
 000001fe00000003e0000003fc00000007e0000007fffffffffff000000ffffffffffff8%
 00003ffffffffffff800007fc007e00007e00000ff000ff00007e00003fe000ff00007e0%
 0007fc001fe00007e0001ffe003fe00007e0003ffe003f800007e000fefe007fc00007e0%
 07fcfe007ff80007e01ff0f800f0ff0007e0ffc0f801e03fc007c0ff00f807e01fc007c0%
 7c00f80fc00fc00fc00000f81f8007c00fc00000f87e0007c01fc00000f8fc0003f81f80%
 0000fbf00003fc1f800003fbc00000fe1f800007fb000001ff1f800007ffffffffff9f80%
 0003ffffffffff9f000001f0000000003f000000e0000000007e00000040000003fffe00%
 0000000000007ffc000000000000003ff8000000000000000ff80000000000000007f000%
 000000000000038000000000000000020000>%% Unicode char "845b
\\\GC75:65:-3:60% G3302
<00000003e0000000000000000001f8000000000000000001fe000000000000000000ff00%
 00000000000000007f0000000000000000007f8000000000000000003f80000000000000%
 00001fc000000000000000001fc000000000000000000fc000000000000000000fc00000%
 0000000000000fc0000780000000000007c0000fc000000000000400001fe00000000000%
 0000003ff0000ffffffffffffffff80003fffffffffffffffc0001fffffffffffffffc00%
 000000000000000000000000000000000000000000000000000000000000000000000000%
 380000000000000000003e0000000000000000003f0000000000000000007fc000000000%
 700000007fe000000000380000007fc0000000003c0000007f80000000001e0000007f80%
 000000001f0000007f00000000000f0000007f00000000000f8000007e000000000007c0%
 0000fe000000000007e00000fc000000000007f00000fc000000000003f80000fc000000%
 000003f80000f8000000000001fc0001f8000000000001fc0001f0000000000001fe0001%
 f0000000000000fe0003f0000000000000ff0003e0000000000000ff0003e00000000000%
 007f8003c00000000000007f8007c00000000000007f8007c00000000000007f80078000%
 00000000003f800f800000000000003f800f000000000000003f800f000000000000003f%
 801f000000000000003f801e000000000000003f003e000000000000001f003c00000000%
 0000001e007c00000000000000180078000000000000001000f8000000000000000000f0%
 000000000000000001e000001c000000000001e000003e000000000003c000007f000000%
 000003c00000ff80ffffffffffffffffffc07fffffffffffffffffe03fffffffffffffff%
 ffe0>%% Unicode char "7acb
\JC48:48:0:40% J5581
<00fc0000000000f80000000000f00000006000f0000000f000f0fffffff800f07ffffffc%
 00f003c0000000f003c0000000f003c0000000f003c0000004f003c0000004f003c00000%
 04fc03c006000cf603c00f000cf703ffff800cf383ffffc018f383c00f8018f3c3c00f00%
 18f3c3c00f0038f183c00f0038f003cc0f0070f003c70f0070f003c38f00f0f003c1cf00%
 f0f003c1cf00e0f003c0cf0000f003c00f0000f003c00f0000f003cc0f0000f003c70f00%
 00f003c38f0000f003c1cf0000f003c1cf0000f003c0cf0000f003c00f0000f003c00f00%
 00f003c00f0000f001800f0000f000000f0000f000000f0000f000000f0000f000000f00%
 00f000000f1800f000000f3c00f0fffffffe00f07fffffff00f000000000006000000000%
 >%% Unicode char "6046
), 182, 328, 331, 364, 384. % 3rd
Guibert, Olivier, 331, 384. % 3rd
Hart, Johnson Murdoch, 331. % 3rd
Historical notes, 28, 31--32, 51--52, 79--80, 121, 198--200, 210, 226, 248, 258--262, 265, 277, 290--291, 293, 295, 301, 308, 317--319, 322, 325--326, 334, 337, 340, 343, 346. % 2nd
Ho, Boon Suan (\GC74:73:-4:60% G2646
<0000f0000000000000000000f8000000000000000000fe000000000000000001ff000000%
 000000000001ff000000000078000001fe0000000000fc000001fc0000000000fe000001%
 f00000000001ff000003f00000000003ff800003e7ffffffffffffc00007e1ffffffffff%
 ffc00007c0ffffffffffffc0000fc0000000007e0000000f80000000007e0000001f8000%
 0000007e0000001f00000000007e0000003f00000000007e0000003e00000000007e0000%
 007e00000000007e0000007c00000000007e0000007f80000000007e000000ffe0000007%
 007e000000fff038000f807e000000efc03e001fc07e000001ef803fffffe07e000001cf%
 803ffffff07e000003cf803ffffff07e0000038f803f000fe07e0000078f803f000f807e%
 0000070f803f000f807e00000f0f803f000f807e00000e0f803f000f807e00001e0f803f%
 000f807e00003c0f803f000f807e00007c0f803f000f807e0000f80f803f000f807e0000%
 e00f803f000f807e0000400f803f000f807e0000000f803f000f807e0000000f803f000f%
 807e0000000f803f000f807e0000000f803f000f807e0000000f803f000f807e0000000f%
 803f000f807e0000000f803fffff807e0000000f803fffff807e0000000f803f000fc07e%
 0000000f803f000fc07e0000000f803f000fc07e0000000f803f000fc07e0000000f803f%
 000f807e0000000f803f000f807e0000000f803e0000007e0000000f80380000007e0000%
 000f80000000007e0000000f80000000007e0000000f80000000007e0000000f80000000%
 007e0000000f80000000007e0000000f80000000007e0000000f80000000007e0000000f%
 80000000007e0000000f80000000007e0000001f80000000007e0000001f8000000fff7e%
 0000001f8000000ffffc0000001f800000007ffc0000001f800000001ffc0000001f8000%
 00000ffc0000001f8000000003f80000001f8000000003f80000001f8000000003e00000%
 00000000000003c00000>%% Unicode char "4f55
\GC73:72:-4:61% G4636
<0000000380000000000000000001e0000000000000000000f0000000000000000000fc00%
 00000000000000007e0000000000000000007f0000000000000000003f80000000000000%
 00003f8000000000000000003fc000000000000000001fc000000000000000001fc00000%
 0000000000001fc00000e000000000001f800001f000000000000f800003f80000000000%
 07000007fc00000000000000000ffe007fffffffffffffffff003fffffffffffffffff80%
 1fffffffffffffffff80000007c00003f0000000000007c00003f0000000000007c00007%
 f0000000000003c00007f0000000000003e00007f0000000000003e00007f00000000000%
 03e00007f0000000000003e00007f0000000000001f0000ff0000000000001f0000ff000%
 0000000001f0000fe0000000000001f8000fe0000000000000f8001fe0000000000000fc%
 001fc0000000000000fc001fc0000000000000fc001fc00000000000007e003f80000000%
 0000007e003f800000000000003f007f000000000000003f007f000000000000003f007e%
 000000000000001f80fe000000000000001f80fc000000000000001fc1fc000000000000%
 000fc3f8000000000000000fe7f8000000000000000fe7f00000000000000007ffe00000%
 000000000007ffc00000000000000003ffc00000000000000003ff800000000000000001%
 ff800000000000000001ffc00000000000000001fff00000000000000003fff800000000%
 00000007fffc000000000000000ff7fe000000000000001fe3ff800000000000003fc1ff%
 c0000000000000ff807ff0000000000001ff003ff8000000000007fe001ffe0000000000%
 0ff8000fffe0000000003fe00007fffe00000000ffc00001ffffff000007ff0000007fff%
 ff80001ffc0000001fffff80007ff000000007fffc0003ffe000000001fff8001fff8000%
 0000000ff000fffe0000000000004000fff00000000000000000ffc00000000000000000%
 >%% Unicode char "6587
\GC78:79:-1:64% G4889
<0000e0000000000000000001f8000000000000000001fc000000000000000001ff000000%
 000000000003ff000000000000000003fe000000000000000003fe00000000003c000003%
 fc00000000007e000007fc0000000000ff000007f80381ffffffff800007f807c0ffffff%
 ffc0000ff00ff07fffffffc0000ff01ff8700fc00000fffffffffc000fc000007fffffff%
 fc000fc000003c1fc00000000fc00000001fc00000000fc00000001f800000000fc00000%
 003f800000000fc00000003f800000000fc00000003f800000000fc00000007f00000000%
 0fc00000007f700000000fc00000007f7c0000000fc00000007f7f0000000fc0000000fe%
 7fc000000fc0000000fe3fe000000fc0000000fc3fc000000fc0000001fc3fc000000fc0%
 000001f83e0000000fc0000001f83e0000000fc0000003f83e0000000fc0000003f03e00%
 00000fc0038003f03e0000000fc007c003e03e0700000fc00fe003e03e0f80000fc01ff0%
 3fc03e1fdffffffffff83ffffffffffffffffffc1ffffffffffffffffffc0ffffffff780%
 0fc0000007003e0000000fc0000002003e0000000fc0000000003e0000000fc000000000%
 3e0000000fc0000000003e0000000fc0000000003e0000000fc0000000003e0000000fc0%
 000000003e0000000fc0000000003e00fc000fc0000000003e07fc000fc0000000003e7f%
 e0000fc0000000003fff80000fc0000000003ffc00000fc000000000fff000000fc00000%
 000fff8000000fc0000001fffe0000000fc000001ffffe0000000fc00000fffffe000000%
 0fc000007fff3e0000000fc000003ffe3e0000000fc000001ff03e0000000fc000001fc0%
 3e0000000fc0000000003e0000000fc0000000003e0000000fc0000000003e0000000fc0%
 000000003e0000000fc0000000003e0000000fc0000000003e0000000fc0000000003e00%
 00000fc0000000003e0000000fc0000000003e0000000fc0000000003e0000000fc00000%
 00003f0000000fc0000000003f0000000fc0000000007f0000001fc0000000007f000000%
 1fc0000000007f0000001fc0000000007f0000001fc000000000780000001e000000>%% u"8f69
), 348. % 2nd
Hoggatt, Verner Emil, Jr\period, 384. % 3rd
Hypergeometric functions, 205, 384. % 3rd
Incidence matrices, 122. % 3rd
Inorder traversal, 170. % 3rd
Inverse permutations, 27, 38--39, 146. % 3rd
Janson, Carl Svante, vi, 186, 194, 196, 200. % 3rd
Kajitani, Yoji (\JC48:48:0:40% J1965
<00000c00001800c00f00003c00f00ffffffe00f80ffffffe00f80f00003c00f00f00003c%
 00f00f00003c00f00f00003c00f18f00003c00f3cf00003cffffeffffffc7fffeffffffc%
 00f00f00003c00f00f00031800f00f00070000f00f000f8001f00f001fc001f00f00ffc0%
 01f00f07fe0001f00f7ff00003fc0f00f00003fe0f00f00003f70f00f00003f78f00f030%
 07f7cf00f07807f3cf7ffffc07f3cf3ffffc07f18f00f0000ef00f00f0000ef00f00f000%
 1cf00f00f0001cf00f00f00c38f00f00f01e30f01fffffff60f01e7fffffc0f01e00f000%
 00f01e00f00000f03e00f00000f03c00f00400f03c00f00400f07800f00600f07000f00e%
 00f0e000f00f00f0c000f81f00f18000ffff00f30000ffff00f000007ffe006000003ffc%
 >%% unicode char "68b6
\JC48:48:0:40% J3511
<0003000000000003800000000003f00f00000007f00780000007e003e000000fc000f800%
 000f80007e00001f00003f80003e00001fc0007c00000fc000f8038007c001f007c003c0%
 03e007c000000fc00fe000003f000ff000003c001e78000000003e7c000000007c3e0000%
 0000f81f00000001f00f80000003e007c0000007c003e000000f8001f000001f0000fc00%
 003e00007f00007c00003fe000f000001fff03e000000fff0f88000027fe3f0c000073fc%
 fc0ffffff8fce00ffffff83c000f0000f000000f0000f000000f0000f000000f0000f000%
 000f0000f000000f0000f000000f0000f000000f0000f000000f0000f000000f0000f000%
 000ffffff000000ffffff000000f0000f000000f0000f000000f0000f000000600006000%
 >%% unicode char "8c37
\JC48:48:0:40% J4546
<03800000020001e03e00030001f00f8007c000f807e007f0007c03f007e0007c01f80fc0%
 007c01fc0f00003c00fc1e00001800fc1c0000000078301880000000203ce0007ffffffe%
 78003ffffffe7c000003c0003e000003c0003f000003c0001f840003c0000f840003c000%
 0f840003c000070c0003c00000080003c03000180003c07800183ffffffc00181ffffffc%
 00300003c00000700003c00000700003c00000e00003c00001e00003c00001c00003c000%
 03c00003c00007c00003c00c07c00003c01e0fc0ffffffffff807fffffff7f800003c000%
 3f800003c0003f800003c0003f800003c0001f800003c0001f800003c0001f800003c000%
 0fc00003c0000fc00003c0000fc00003c0000fc00003c00007c00003c000078000018000%
 >%% unicode char "6d0b
\JC45:48:0:40% J2742
<0000000000600000000000f0fffffffffff87ffffffffff80000000000f00000000000f0%
 0000000000f00000000000f00000000700f00000000f80f00fffffffc0f007ffffffc0f0%
 0000000000f00000000000f00000000000f00000000000f00060006000f0007800f000f0%
 007ffff800f0007ffff800f0007800f000f0007800f000f0007800f000f0007800f000f0%
 007800f000f0007800f000f0007800f000f0007800f000f0007800f000f0007800f000f0%
 007800f000f0007800f000f0007ffff000f0007ffff000f0007800f000f00078006000f0%
 0030000000f00000000000f00000000000f00000000000f00000000000f00000000000f0%
 0000000000f00000000001f0000000003ff0000000000ff00000000007e00000000003c0%
 >%% unicode char "53f8
), 331. % 3rd
Kernels of a graph (maximal independent sets), 143, 244, 269. % 2nd
Kleiman, Mark Philip, 384. % 3rd
Kilomem ($\rm K\mu$): One thousand memory accesses, 75. % 4th
Knuth, Donald Ervin (\GC75:75:-3:62% G2463
<0000001f0000000000000000001ff8000000000000000007ff000000000000000003ff80%
 00000000000000007f8000000000000000007f8000000000000000003f8000003c000000%
 00003f8000007e00000000001f800000ff00000000000f800001ff00ffffffffffffffff%
 ff80ffffffffffffffffffc07fffffffffffffffffe03800000000000000000000000000%
 00000000000000000000000070000000000078000000f800000000007f000001fc000000%
 00007ffffffffe00000000007fffffffff00000000003ffffffffe00000000003f000000%
 fc00000000003f000000fc00000000003f000000fc00000000003f000000fc0000000000%
 3f000000fc00000000003f000000fc00000000003f000000fc00000000003f000000fc00%
 000000003ffffffffc00000000003ffffffffc00000000003ffffffffc00000000003f00%
 0000fc00000000003f000000fc00000000003f000000fc00000001c03e0000000003c000%
 01e03e0000000007e00001f800000000000ff00001fffffffffffffff00001ffffffffff%
 fffff80001f8000000000007f80001f8000000000007e00001f8000000000007e00001f8%
 000000000007e00001f801c000078007e00001f801e00007e007e00001f801f8000ff007%
 e00001f801fffffff007e00001f801fffffff007e00001f801ffffffc007e00001f801f8%
 000fc007e00001f801f8000fc007e00001f801f8000fc007e00001f801f8000fc007e000%
 01f801f8000fc007e00001f801f8000fc007e00001f801f8000fc007e00001f801f8000f%
 c007e00001f801f8000fc007e00001f801ffffffc007e00001f801ffffffc007e00001f8%
 01ffffffc007e00001f801f8000fc007e00001f801f0000fc007e00001f801f0000f0007%
 e00001f801f000000007e00001f8000000000007e00001f800000000ffcfe00001f80000%
 00007fffc00001f8000000000fffc00001f80000000000ffc00001f800000000007f8000%
 01f800000000003f800001f000000000001f000001f00000000000100000>%% Unicode char "9ad8
\GC73:74:-4:61% G2134
<00006000001c000000000000f000001f000000000000f800001fc00000000001fc00001f%
 e00000000001fe00001fe00000000003fe00001fc00000000003f800001fc00000000007%
 f000001f800070000007e000003f0000f800000fc000003f0001fc00001f8000007e0003%
 fe00001f07ffffffffffff00003e03ffffffffffff80007c0100007c0000000000f80000%
 00780000000000f0000000780000000001e0000000700000000003c03838007000070000%
 07807c3c00f0000f80001f007f3f00e0001f80003e00ffbfffffffffc0007c00ffbfffff%
 ffffe000f801ff1fffffffffe000c001fe1f03e0780f80000003fe1f03e0780f80000003%
 fc1f03e0780f80000007f81f03e0780f80000007f01f03e0780f8000000fe01f03e0780f%
 8000000fc01f03e0780fc000001f801f03e0780fc000003f001f03e0780fc000003fe01f%
 03e0780fc000007fe01f03e0780fc00000ffe01f03e0780fc00000ffc01fffffffffc000%
 01ffc01fffffffffc00001ff803fffffffffc00001ff803f0000000f800003df803f0000%
 000f8000079f803f0000000038000f9f803f000000007c001f1f800000000000fe003e1f%
 800000000001ff007c1fbfffffffffffff80f81f9fffffffffffff80e01f880000000000%
 0000801f8000003000000000001f8000001c00000000001f8000f01e00000000001f8000%
 fc0f001e0000001f8000ff0f801f0000001f8060ff07c00f8000001f8060ff07e00fe000%
 001f8060fe03e007f000001f8060fc03e003f800001f8060fc03f003fc00001f80e0fc03%
 f0c1fe00001f81e0fc03f0c0ff00001f81e0fc03e0e0ff00001f83e0fc01e0e07f00001f%
 83e0fc0000e07f00001f87e0fc0000e03f00001f9fe0fc0001f03f00001fbfe0fc0001f0%
 1f00001fbfe0fc0003f01f00001f9fe0fe0003f81800001f9fc0fffffff80000001f8380%
 fffffff80000001f80007ffffff80000001f80003ffffff00000001f80001ffffff00000%
 001f8000000000000000001f0000000000000000>%% Unicode char "5fb7
\GC71:74:-3:61% G3641
<000000000003800000000000000003f00000000300000003fc00000003c0000003fc0000%
 0003e0000003f800000007f0000003f800000007f0000003f000000007e0000003f00000%
 0007e0000003f000000007c0000003f00000000fc0000003f00000000f80000003f00000%
 001f00000003e00000001f00000003e000e0003e00038003e001f0003e00c3e003e001f8%
 007c00e1f803e003fc007800f1fffffffffe00f801f9fffffffffe00f001fdf003e003fc%
 01e003fff003e003f801e007fff003e003f001c007fdf003e003f003800ff9f003e003f0%
 03001ff1f003e003f00f003fe1f003e003f01e01ffc1f003e003f0ffffff81f003e003f0%
 ffffff01f003e003f07ffcfe01f007e003f07ff0fc01f007c003f03fc1f801f007c003f0%
 3c01f001f007e003f00003e001f00ff003f00003c001f00ff803f00007c001f00ffc03f0%
 000f8001f00f9e03f0001f0001f01f9f83f0001e0001f01f0fc3f0003e0001f01f07e3f0%
 007c0001f03e07e3f000f80001f03e03f3f001f00001f03c03f3f007e00ff9f07c03fbf0%
 0fc3fff9f07803fbf01fffffc1f0f801fbf01fffff01f0f001fbf00ffff001f1f001fbf0%
 0ffc0001f1e001fbf007f00001f3c000fbf007c00001f30000fbf002000001f600007bf0%
 00000001f4000003f000000001f4000003f000000001f0000003f000000001f0000003f0%
 000003fff0000003f00001fffff0000003f000fffff1f0000003f07fffffe1f0000003f0%
 7ffffc01f0000003f07fffe001f0000003f03fff8001f0000003f03ff00001f0000003f0%
 3f800001f0000007f01e000001f0003c07f010000001f0000ffff000000001f00003fff0%
 00000001f000007ff000000001f000003ff000000001f000001ff000000001f000001fc0%
 00000003f000000f80000000000000000e00>%% Unicode char "7eb3
), i, iv--vi, viii, 44, 52, 53, 61, 71, 75--77, 98, 116, 121, 196, 200, 209, 214, 219, 221, 227, 228, 232--235, 237, 239--240, 248, 254, 267, 268, 271, 274, 281, 283--286, 288, 289, 292, 293, 309--311, 316, 319, 322, 331, 335, 340, 341, 346, 348, 349, 352, 356, 364, 368. % 4th
Komisarski, Andrzej, 183. % 3rd
L-twist, 80, 172, 336. % 3rd
Left-to-right maxima or minima, 384. % 3rd
Linear programming problems, 287, 332--333. % 2nd
Loops (cyclic paths), 141, 175--178, 345--346. % 3rd
Lou, Xingliang David (\GC79:78:-1:63% G3406
<000000001e0000000000000000001f8000000000000000000fe000000000000000000ff0%
 000000000003c0000ff0007800000001e0000fc0007c00000000fc000f8000fe00000000%
 7e000f8000ff000000003f000f8001ff800000001f800f8001fe000000000fc00f8003f8%
 0000000007e00f8003f00000000007e00f8007e00000000003f00f800fc00000000003f0%
 0f800f000000000001f00f801e003800000001e00f807c007c00000000e00f81f000fe00%
 000000c00f87c001ff0003ffffffffffffffff8001ffffffffffffffffc001ffffffffff%
 ffffffc000f0001fff8f000000000000003fefc7c00000000000003fcfc3e00000000000%
 007f8fc3f0000000000000ff0fc1f8000000000001fe0fc0fe000000000003fc0fc07f80%
 0000000007f80fc03fe0000000001fe00fc01ff8000000003fc00fc007ff000000007f80%
 0fc003ffe0000000ff000fc001fffc000003fc001fc000fffffe000ff0007f80003ffffe%
 001fc0007f800007fff8007f00007c000001ffe003fc00007e0000001f801fe000007f00%
 00000100ff800000ff0000000000e0000000ff000000000000000001fe0000001c000000%
 0001fe0000003e0000000003fc0000003f0000000007f80000007f800000000fc0000000%
 ffc007ffffffffffffffffe003fffffffffffffffff001e0001f80003f8000000000003f%
 00003f8000000000003f00003f0000000000003e00007f0000000000007e00007f000000%
 0000007c0000ff000000000000f80001fe000000000001f00003fc000000000003f80007%
 fc000000000007ff800ff8000000000007fff81ff00000000000007fffffe00000000000%
 0007ffffc0000000000000001ffff80000000000000003ffff8000000000000007fffff8%
 0000000000001ffffffe0000000000003ff8ffff800000000000ffe03fffe00000000003%
 ffc007fff0000000001fff0001fff0000000007ffe00007ff800000001fff800003ff800%
 00003fff8000000ff8000007fff800000003f8003fffff8000000001f8003ffff8000000%
 000070000010000000000000300000000000000000001000>%% unicode char "5a04
\GC77:74:-2:62% G4839
<00000000000000380000000e00000000007c0000000f80000000007e00000007c0000000%
 00fe00000007f000000001ff00000007ffffffffffff80000007ffffffffffff80000007%
 c0000000007f00000007c0000000007e00000007c0000000007c00000007c0000000007c%
 00000007c0000000007c00000007c0000000007c00000007c0000000007c00000007c000%
 0000007c00000007c0000000007c00000007fffffffffffc00000007fffffffffffc0000%
 0007c0000000007c00000007c0000000007c00000007c0000000007c00000007c0000000%
 007c00000007c0000000007c00000007c0000000007c00000007c0000000007c00000007%
 c0000000007e00000007c0000000007e00000007c0000000007e0000000ffffffffffffe%
 0000000ffffffffffffe0000000fc0000000007e0000000fc0001e00007e0000000fc000%
 1f80007e0000000fc0001ff000780000000fe0001ff0000000000001f0001ff000000000%
 0001fc001fe0000000000001fe001fc0000000000003fe001fc0000380000003fc001f80%
 000fc0000003f8001f80001fe0000007f8001f80003ff0000007fffffffffffff800000f%
 fffffffffffffc00000ffffffffffffffe00001f00001f8000000000001f00001f800000%
 0000003e00001f8000000000003e00001f8000000000007c00001f800000000000fc0000%
 1f800000000000f800001f800070000001f800001f8000f8000001f000001f8001fc0000%
 03f000001f8003fe000003e000001f8007ff000007c7ffffffffffff80000f81ffffffff%
 ffff80001f80ffffffffffff80003f0030001f80000000007e0000001f8000000000f800%
 00001f8000000000f00000001f8000000000400000001f8000000000400000001f800000%
 0000000000001f8000001e00000000001f8000003f00000000001f8000007f8000000000%
 1f800000ffc0000000001f800001ffe0fffffffffffffffffff07ffffffffffffffffff8%
 7ffffffffffffffffff820000000000000000000>%% unicode char "661f
\GC79:80:0:64% G3333
<00000000380000000000000000007e0000000000000000003f0000000000000000001f80%
 00000000000000001fc000000000000000000fc0000000000000000007e0000000000000%
 000007e000001c000000000003c000003e000000000003c000007f800000000003800000%
 ffc00000000003800001ffe00ffffffffffffffffff007fffffffffffffffff002000000%
 0000000000000000000000000000000000000000000003c0000000003800000003c00000%
 00003e00000007f8000000003f80000007fc000000001ffffffffffc000000001fffffff%
 fffc000000001f80000003f8000000001f80000003f0000000001f80000003f000000000%
 1f80000003f0000000001f80000003f0000000001f80000003f0000000001f80000003f0%
 000000001f80000003f0000000001f80000003f0000000001f80000003f0000000001fff%
 fffffff0000000001ffffffffff0000000001f80000003f0000000001f80000003f00000%
 00e01f80000003c0000000e01f0000000000070000e01f00000000000f8000e000000000%
 00000fe000e00000000000001ff000fffffffffffffffff803fffffffffffffffffc03e0%
 0000000000003ffe03e00000000000003ff003e00000000000003fe007e0000000000000%
 7f800fe00000000000007c007fe000000000e000f0007fe000380001f007c0007fc0003e%
 0001fc0780003f80003f0003fe0600003e00003fffffff0200000800003fffffff000000%
 0000003f0003ff0000000000003f0003ff0000000000003f0003fc0000000000003f0003%
 f00000300000003f0003f00000300000003f0003f00000300000003f0003f00000300000%
 007f0003f00000300000007f0003f00000300000007f0003f00000300000007e0003f000%
 0030000000fe0003f0000030000000fc0003f0000078000001fc0003f00000f8000001f8%
 0003f00000fc000003f80003f80000fe000007f00003fc0000fe00000fe00003fffffffe%
 00001fc00001fffffffe00003f800001fffffffe0001ff000000fffffff80007fc000000%
 3ffffff001ffe000000000000000ffff8000000000000000fff80000000000000000ffc0%
 0000000000000000>%% unicode char "4eae
), 224. % 3rd
%Luria, Zur ({\heb\Haa/\Hyy/\Hrr/\Hvv/\Hll/ \Hrr/\Hvv/\Hts/}), 207. % 3rd
Magen, Avner ({\heb\Hfn/\Hgg/\Hmm/ \Hrr/\Hnn/\Hbb/\Haa/}), 26. % 3rd
{\mc MCC} problems: Multiple covering with colors, iv, 91--93, 121, 142--144, 239, 240, 251, 267--271, 280, 302, 303, 306, 325, 355. % 2nd
{\mc MCC} problems: Multiple covering with colors, iv, 91--93, 121, 142--144, 239, 240, 250, 251, 267--271, 280, 302, 303, 306, 325, 355. % 3rd
McDonald, Gary, 250, 356. % 2nd
Mebane, Palmer Croasdale, 346. % 3rd
Median function ($\langle xyz\rangle$), vi, 24, 201, 353. % 3rd
Median value of a random variable, 14, 204. % 3rd
Minimum cutsets, 344. % 2nd
Mirror images, \see Reflection symmetry. % 3rd
Modifications of Algorithm 7\period2\period2\period1C and related algorithms, 124, 125, 130, 131, 136, 181, 230, 250, 253, 350. % 2nd
Molinari, Rory Benedict, 344. % 2nd
Murata, Hiroshi (\JC48:48:0:40% J3428
<007000001c00007c00001f00003e00001f80003e00000f80003c00000f00003c00000f00%
 003c00000f00003c00000f00003c00000f00003c00000f00003c30000f0c003c78000f1e%
 fffffcffffff7ffffc7fffff003c00000f00003c00000f00003c00000f00003c00000f00%
 007f00000f00007fc0000f0000fcf0c00f0000fcf8e00f0000fc7c780f0001fc3c7c0f00%
 01fc3c3e0f0003fc183e0f0003bc001f0f0007bc001f0f00073c000f0f000f3c000e0f00%
 1e3c00000f003c3c00000f00f03c00000f00c03c00000f00003c00000f00003c00000f00%
 003c00000f00003c00000f00003c00000f00003c00000f00003c00000f00003c00000f00%
 003c00000f00003c00000f00003c0001ff00003c0000ff00003c00007e00001800003c00%
 >%% unicode char "6751
\JC41:46:-4:38% J3736
<c00000000600f00000000f00ffffffffff80ffffffffff80f0003c000f00f0003c000f00%
 f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00%
 f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00%
 f0003c000f00f0003c000f00ffffffffff00ffffffffff00f0003c000f00f0003c000f00%
 f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00%
 f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00f0003c000f00%
 f0003c000f00f0003c000f00f0003c000f00f0003c000f00ffffffffff00ffffffffff00%
 f00000000f00f00000000f00f00000000600600000000000>%% unicode char "7530
\JC48:48:0:40% J4546
<03800000020001e03e00030001f00f8007c000f807e007f0007c03f007e0007c01f80fc0%
 007c01fc0f00003c00fc1e00001800fc1c0000000078301880000000203ce0007ffffffe%
 78003ffffffe7c000003c0003e000003c0003f000003c0001f840003c0000f840003c000%
 0f840003c000070c0003c00000080003c03000180003c07800183ffffffc00181ffffffc%
 00300003c00000700003c00000700003c00000e00003c00001e00003c00001c00003c000%
 03c00003c00007c00003c00c07c00003c01e0fc0ffffffffff807fffffff7f800003c000%
 3f800003c0003f800003c0003f800003c0001f800003c0001f800003c0001f800003c000%
 0fc00003c0000fc00003c0000fc00003c0000fc00003c00007c00003c000078000018000%
 >%% unicode char "6d0b
), 331. % 3rd
$n$ queens problem (independent queens), 29--32, 44--46, 51--53, 68--71, 103, 108, 110--111, 116, 120, 121, 124--126, 143, 148, 150, 232. % 3rd
$n$-queens problem (dominating queens),  91--92, 142. % 2nd
Nixon, Dennison, 319. % 2nd
Nobel, Parth Talpur, 207. % 3rd
Odlyzko, Andrew Michael, 384. % 3rd
OEIS\regtm: The On-Line Encyclopedia of Integer Sequences\regtm\ ({\tt oeis\period org}), 230, 231, 263, 277, 312, 324. % 3rd
Ollerton, Richard Laurance, 384. % 3rd
Onnen, Hendrik, Sr\period, 32. % 2nd
Ordered options, \see Pairwise ordering trick. % 2nd
Parallel programming, 52. % 4th
Pendant vertex: A vertex of degree one, 314. % 2nd
Permutations, 27, 32, 53, 101, 105, 122, 133, 135, 138, 146, 168, 351. % 3rd
Pi, as source of ``random'' data, 45--46, 48, 55, 58, 72, 76, 114--115, 126, 128, 144, 152, 158, 172--175, 180, 181, 346, 384.
Pinch, Ruth, 356. % 2nd
Pinter, Ron Yair ({\heb\Hrr/\Htt/\Hnn/\Hyy/\Hpp/  \Hrr/\Hyy/\Haa/\Hyy/ \Hfn/\Hvv/\Hrr/}), 331. % 3rd
Pittel, Boris Gershon ({\rus Pittelp1, Boris Gershonovich}), 196, 231. % 3rd
Planar graphs, 112, 344. % 3rd
Projection vectors, 345, 346--348. % 2nd
Puzzle Square JP, 346. % 3rd
q\period s\period: Asymptotically quite surely, 12, 20, 21, 25, 56, 147, 183, 204, 291. % 4th
Queen domination problems, 91--92, 142. % 2nd
R-twist, \see L-twist. % 3rd
Recurrence relations, 99--101, 146, 192, 197, 216, 226, 355, 384. % 3rd
Reflection symmetry, 40, 53, 81, 89, 165, 169, 172, 206, 236--237, 257, 260--262, 303. % 3rd
Right-to-left maxima or minima, 384. % 3rd
Rooms and bounds, 169--170, 384.
{\mc SAT} solvers, 148, 213--214, 235, 274, 296, 303, 321, 346. % 3rd
Semiperimeter, 171. % 3rd
Simkin, Menahem Michael\indexbreak ({\heb\Hfn/\Hvv/\Hqq/\Hmm/\Hvv/\Hss/ \Hll/\Haa/\Hcc/\Hyy/\Hmm/ \Hfm/\Hhh/\Hnn/\Hmm/}), 53. % 3rd
Social distancing, 157. % 3rd
Spanning trees, 60, 353. % 3rd
Stappers, Filip Jan Jos, 234. % 2nd
Stong, Richard Andrew, 248. % 4th
Stork, David Geoffrey, 183. % 2nd
Tatami tilings, 155, 169--170, 240, 296, 305, 328. % 3rd
Ternary commafree codes, 36--37, 39, 214. % 3rd
Time stamps, 42--45, 56, 280. % 4th
Torczon, Linda Marie, 39. % 3rd
Tree insertion, 330. % 3rd
Trick shapes, 162. % 3rd
Trybu{\l}a, Stanis{\l}aw Czes{\l}aw, 183. % 2nd
Twin tree structure, 170. % 3rd
VLSI layout, 331. % 3rd
Watanabe, Tomomi (\JC48:48:0:40% J3747
<0380000e000001e0000f000001f0000f800000f8000f8000007cc00f000c007ce00f001e%
 007cffffffff003cffffffff0018f00000000000f06018008000f0781e00e000f07c1f00%
 7800f07c1f007c00f0781e303e00f0781e783f00fffffffc1f84f7fffffc0f84f0781e00%
 0f84f0781e00070cf0781e000008f0781e000018f0781e000018f07ffe000018f07ffe00%
 0030f0781e000070f0300c000070f000018000e0f00003c001e0f7ffffe001c0f3ffffe0%
 03c0f0c007c007c0f0c0078007c0f0600f800fc0f0701f00ff80f0381e007f80f01c3c00%
 3f80f00e78003f81f00ff0003f81e007e0001f81e003c0001f81c007f0001f83c01ffc00%
 0fc3803eff800fc3807c7ffe0fc600f03ffe0fc603c01ffc07cc1f0007fc0788f80001f8%
 >%% unicode char "6e21
\JC48:45:0:37% J4253
<0000000000303800000000781f01fffffffc0fc0fffffffc07e0007c007803f0007c0078%
 03f8007c007801f8007c007801f8007c007800f0007c00780000007c00780000007c0078%
 000000780078000000f80078000000f80078000000f80078000000f80078006000f00078%
 00f000f00078fff801f000787ff801f0007800f001e0007800f001e0007800f003e000f0%
 00f003c000f000f003c000f000f007c000f000f0078001f000f0078001e000f0070001e0%
 00f00f0003e000f00e000fc000f01c01ffc000f01c007f8000f038003f0000f030001e00%
 01f86000000003dc000000000fcf000000003f87ffffffffff03fffffffffe00fffffffe%
 7c003ffffffe780000000000300000000000>%% unicode char "8fba
\JC48:47:0:39% J3546
<006000000000007c00000000007c0000000000780000000000780000000000f0000c001c%
 00f0000e003e00e0030fffff01e0078fffff01ffffcf003c03ffffcf003c038f000f003c%
 070f000f003c0e0f000f003c1c0f000f003c380f000f003c300f000f003c000f000f003c%
 000f000f003c000f00cf003c000f01ef003cffffffff003c7fffffff003c000f000f003c%
 000f000f003c000f000f003c000f000f003c000f000f003c000f000f003c000f000f003c%
 000f000f003c001f800f003c001ec00f003c001c600f003c003c700f003c003c380f003c%
 003c3c0f003c00781e0f003c00781e0f003c00f00f0ffffc00f00f0ffffc01e0070f003c%
 03c0070f003c0780000f003c0f00000600183c0000000000f00000000000>%% uni "77e5
\JC44:46:-4:38% J2442
<000000001c00000000003e00ffffffffff007fffffffff00000000003c00000000003c00%
 000000003c00000000003c00000000003c00000000003c00000000003c00000000003c00%
 000000003c00000000003c00c00000003c00e00000003c00fffffffffc00fffffffffc00%
 f00000003c00f00000003c00f00000003c00f00000001800f00000000000f00000000000%
 f00000000000f00000000000f00000000000f00000000000f00000000000f00000000000%
 f00000000000f00000000000f00000000080f000000000c0f000000000c0f000000000e0%
 f000000000e0f000000000f0f000000000f0f000000000f0f800000001f0fc00000003f0%
 fffffffffff0fffffffffff07fffffffffe03fffffffffc0>%% unicode "5df1
), 331. % 3rd
Windsor, Aaron Andrew, 213, 214, 250. % 3rd
\.{WORDS}($n$), the $n$ most common five-letter words of English, 34, 54, 60, 92, 131, 181, 209, 242, 251, 271--272, 292. % 2nd
Yano, Tatsuo (= Ryouh, \JC48:47:0:40% J4480
<000800000000000e00000000000f80000000000fe0000000001ff0000000001fe0000000%
 001fc0000000001f80000000003f80000600003f00000f00003fffffff80007fffffff80%
 007c0600000000f807c0000000f007e0000001e007e0000003c007c00000038007c00000%
 070007c000000e0007c00000180007c00000300007c00018000007c0003c7ffffffffffe%
 3ffffffffffe000007c00000000007c0000000000fc0000000000fe0000000001fe00000%
 00001f70000000003e70000000003e38000000007e38000000007c1c00000000f81e0000%
 0001f80f00000003f00780000007e007c000000fc003f000001f8001fc00003f0000ff80%
 00fe00007ff801f800003fff07e000000ffe3f00000003fef8000000007c>%% unicode "77e2
\JC48:48:0:40% J4478
<3000180000183c003c00003c3ffffefffffe3ffffe7ffffe3c3c3c0001fc3c3c3c0001f8%
 3c3c3c0003f03c3c3c0003e03c3c3c0007803c3c3c1c07003c3c3c070c003c3c3c07c000%
 3ffffc03e0003ffffc01f0003c3c3c01f0003c3c3c00f0003c3c3c00e00c3c3c3c00001e%
 3c3c3fffffff3c3c3dffffff3c3c3c00f83f3c3c3c00f83e3ffffc00f87c3ffffc00f878%
 3c3c3c00f8f0183c1800f8e0003c0000f9c0003c0000f980003c0000fb00003c1800fa00%
 003c3c00f8003ffffe00f8001ffffe00f800003c0000f800003c0000f800003c0000f800%
 003c0000f800003c0000f800003c0000f800003c3fc0f800007ffc00f800fffff000f800%
 ffff0000f8007ff80001f8007fe0003ff8007c000007f80020000001f00000000000e000%
 >%% unicode char "91ce
\JC48:48:0:40% J4622
<003000600000003c00780000003e007c0000003e007c0060003c307800f0003c787ffff8%
 3ffffc7ffff81ffffc7800000303807800000383c07800c001c3e07801e001c3c07ffff0%
 01e7807ffff001e7007801e001e70c3001e000c61e0001e0ffffff0001e07fffff6001e0%
 0000007801e00c00607fffe00f00f07fffe00ffff87801e00ffff87800c00f00f0780000%
 0f00f07803000f00f07807800f00f07fffc00ffff07fffc00ffff07800000f00f0780000%
 0f00f07803000f00f07807800f00f07fffc00ffff07fffc00ffff07800000f00f0780000%
 0f00f07803000f00f07807840f00f07fffc40f00f07fffc40f00f078000c0f00f078000e%
 0f00f078000e0f01f078001f0f3ff07c003f0f07f07fffff0f01f07ffffe0600e03ffffc%
 >%% unicode char "9f8d
\JC48:44:0:38% J1806
<0000000000300000000000783ffffffffffc1ffffffffffc000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c00000000003c000c0000003c001e00ffffffffff007fffffffff0000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c00000000003c00000%
 000003c00000000003c00000000003c00000000003c00000000003c0001c000003c0003e%
 ffffffffffff7fffffffffff>%% unicode char "738b
), 340, 346. % 3rd
Yao, Bo (\GC77:78:-1:63% G5006
<0003c0000000000000000003f000000003c000000003fc00001c03e000000003fc00001f%
 83f800000007f000001fe3fc00000007f000001fe3fc00000007f000001fe3f800000007%
 f000001fc3f000000007f000001f83f000000007f000001f83f000000007f000001f83f0%
 00000007f000001f83f000000007f000001f83f000000007f000001f83f00000000ff000%
 001f83f00000000ff000001f83f00000000ff070001f83f00000000ff0f8001f83f00000%
 000fe1fc601f83f00380000fe3fe601f83f003c0ffffffff301f83f007e03fffffff381f%
 83f007f01ffffffc381f83f00ff8000f80fc3c1f83f01ff8000f80fc3e1f83f03fc0000f%
 80fc3e1f83f03f80001f80fc1f1f83f07e00001f01fc1f1f83f0f800001f01f81f9f83f3%
 f000001f01f81f9f83f7c000001f01f81f9f83ff0000001f01f80f9f83fc0000001f01f8%
 0f1f83f00000003f01f80f1f83f00000003f01f8081f83f00000003e03f8001f83f00000%
 003e03f0001f83f00000007e03f0001f83f00000007e03f0001f83f00000007c03f0001f%
 83fe0000007c03e0003f83ff800000fc07e0007f83f7f00000fc07e000ff83f3fc0000f8%
 07e003df83f1fe0001f807c0079f83f0ff0001f80fc01f1f83f07f8001f00fc7fe1f83f0%
 7f8003f01f87fe1f83f03fc003f01f83fc1f03f01fc003e03f01f81f03f01fc001f83f00%
 f03f03f00fc000fe7e00603f03f007c0003ffe00003f03f003c0000ffc00003f03f00100%
 0007fc00007f03f000000003fc00007e03f000000001ff0000fe03f000000001ff8000fc%
 03f000c00003ffe001fc03f000c00003eff001fc03f000e00007c7fc03f803f000e0000f%
 83fe03f803f000e0001f81fe07f003f000e0001f00ff0fe003f000e0003e007f1fc003f0%
 00e0007c007f1fc003f000f000f8003f3f8003f001f003f0001f7f0003f001f007e00018%
 fe0003f803f00fc00008fc0003fc03f81f800001f80003fffff87e000003e00001fffff8%
 f8000007c00001fffff8f000000f800000fffff8400000ff0000003ffff8000007f80000%
 00000000000007c000000000000000000200000000000000>%% unicode char "59da
\GC76:77:-3:63% G1808
<00000000000700000000000000000007c0000000000000000007f0000000000000000007%
 fc000000000000000007fc00000007c000000007f000000003f800000007e000000001fe%
 00000007e000000000ff00000007e0000000007f00000007e0000000003f80000007e000%
 0000001f80000007e0000000000f80000007e0000000000f80380007e00038000007803c%
 0007e0007c000006003f0007e0007f0000040c3f8007e000ff8000001c3fffffffffffc0%
 0000183fffffffffffe00000183f8007e001ffe00000183f8007e003ff80f000383f8007%
 e007ff007800303f8007e007fc003e00703f8007e00ff0003f80701f8007e01fc0001fc0%
 701f8007e01f00000fe0e01f8007e03c000007e0e01f8007e030000007e0e01f8007e010%
 000003f1e01f8007e000000003f1c01f8007e000000003f1c01f8007e000000003e3c01f%
 8007e007000001e3c01f8007e00f80000003801f8007e01fc0000007801f8007e03fc000%
 0007801fffffffffe000000f801ffffffffff000000f001f8780003ff000001f001f8380%
 003f8000001f001f83c0007f0000003f001f83c0007f0000007e001f81e0007e0000007e%
 001f81e0007c000000fe001f81f000fc000000fc003f80f000f8000001fc003f80f801f8%
 000001fc003f80fc01f8000003f8003f807c03f000003ff8003f007e03f000003ff8003f%
 003f07e000000ff0003f003f07e0000007f0007e001f8fc0000003f0007e001fdf800000%
 01f8007e000fdf80000001f800fc0007ff00000000f800fc0007fe00000000f800f80003%
 fc00000000f800f80003fc00000001f801f00003fc00000001f801f00007ff00000001f8%
 03e0000fff80000001f803e0001fbfc0000003f807c0001f1ff0000003f80fc0003e0ff8%
 000003f80f80007c07ff000003f81f0000f803ffc00003f81e0003f001fff80003f83e00%
 0fe000ffff8003f87c001f80003ffff003f9f8007f00001ffff000fbf001fc000007fff0%
 002fc01ff8000003ffc0001f00ffe0000000ff00001c0fff000000003c0000100ffc0000%
 0000080000000800000000000000>%% unicode char "6ce2
), 331. % 3rd

\vfill % TEMPORARY

\enddoublecolumns
\endgroup
\endchange

\vfill\eject
\amendpage 4f5.384 a new section following the index (21.09.18)
\bigskip
\rightline{\titlefont BREAKING NEWS}
\bigskip\noindent
\tenpoint
\pageref|breaking|{\tencsc Here}
 are answers to \MPR\ exercises that were recently added.
\bigskip
\ninepoint
\ans135.
 (Notice that the smallest {\it non\/}-Baxter permutations
are 3142 and its inverse, 2413.)\par
If $P$ is a Baxter permutation, so are $P^R=p_n\ldots p_1$ and
$P^C=\bar p_1\ldots \bar p_n$, where $\bar x=n+1-x$.
So is the permutation $P\setminus n$ obtained by
deleting~$n$; and so are the permutations $P\setminus x$ obtained by
deleting~$x$ and subtracting 1 from each element that exceeds~$x$, if
$x=p_n$ or $x=1$ or $x=p_1$. (Consider, for example, deleting~$n$ from $P^-$.)
\par\breathe
 Let's look at the $n+1$ permutations obtained by {\it inserting\/} $n+1$
into an $n$-element Baxter permutation. For example, when $n=8$ and
$P=21836745$ the nine extensions are
921836745,
291836745,
219836745,
218936745,
218396745,
218369745,
218367945,
218367495,
218367459.
Only four of these fail Baxter's property, namely
291836745, 218396745, 218369745, and 218367495; and we soon discover the
general rule: {\sl $n+1$ can be Baxterly inserted if and only if it's placed
just before a left-to-right maximum, or just after a right-to-left
maximum.} (In our example, the left-to-right maxima are 2 and~8; the
right-to-left maxima are 5, 7, and~8.)\par
Let $B_n(i,j,k)$ be the number of $(n+1)$-element Baxter permutations
with exactly $i+1$ left-to-right maxima, $j+1$ left-to-right minima,
$k$~ascents, and $n-k$~descents.
Such permutations correspond to floorplans with
$n+1$ rooms, $i+1$ rooms touching the bottom of the frame,
$j+1$ rooms touching the left of the frame, $k+2$ vertical bounds,
and $n-k+2$ horizontal bounds (see exercise 7.2.2.1--372).
The reasoning above yields the interesting recurrence
$$\medmuskip=1mu
B_1(i,j,k)=\[i=j=k=0],\
B_{n+1}(i+1,j+1,k)=\sum_{i'>i}B_n(i',j,k)\,+\sum_{j'>j}B_n(i,j',k-1);$$
% B_n(i,j,k)=B_n(j,i,n-k)
and the solution can be expressed as a determinant of
binomial coefficients:
$$B_n(i,j,k)=\det\pmatrix{
{n-j-1\choose k-1} & {n\choose k-1} & {n-i-1\choose n-k+1}\cr
{n-j-1\choose k}   & {n\choose k}   & {n-i-1\choose n-k}\cr
{n-j-1\choose k+1} & {n\choose k+1} & {n-i-1\choose n-k-1}\cr
},\ \hbox{unless $\left\{\vcenter{\halign{#\hfil\cr
                             $i=0$ and $j=n$\cr
                             \quad or\cr
                             $i=n$ and $j=0$.\cr}}\right.$}$$
% exceptions are cases where {x\choose-1} is sensitive...
Summing on $i$ and $j$ now gives the simpler formula
$$b_n(k)=t_{n+1}(k+1)/t_{n+1}(1),\quad\hbox{where
  $t_n(k)={n\choose k-1}{n\choose k}{n\choose k+1}$,}$$
for the number of $n$-element Baxter permutations with exactly $k$ ascents.\par
Since the terms with $k\approx n/2$ dominate the sum
$b_n=\sum_k b_n(k)$, we obtain the asymptotic value
$$b_n={8^{n+2}\over\sqrt{12} \pi n^4}\Bigl(1-{22\over3n}+O(n^{-2})\Bigr),$$
due to A.~M. Odlyzko.
[See G. Baxter, {\sl Proc.\ American Math.\ Soc.\ \bf15} (1964), 851--855;
F.~R.~K. Chung, R.~L. Graham, V.~E. Hoggatt,~Jr., and
M.~Kleiman, {\sl Journal of Combinatorial Theory\/ \bf A24} (1978),
382--394;
W.~M. Boyce, {\sl Houston J. Math. \bf7} (1981), 175--189;
S.~Dulucq and O.~Guibert, {\sl Discrete Math.\ \bf180} (1998),
143--156.] R.~L. Ollerton has found the recurrence
$(n+2)(n+3)b_n=(7n^2+7n-2)b_{n-1}+8(n-\nobreak1)(n-2)b_{n-2}$, with $b_1=1$,
as well as the closed form
$b_n=F\bigl({1-n,-n,-1-n\atop2,3}\bigm\vert-1\bigr)$.
The initial terms are $(b_0,b_1,\ldots{})=(1$, 1, 2, 6, 22, 92, 422,
2074, 10754, 58202, \dots). % OEIS A1181
\endchange

\amendpage 4f5.384 new answer (21.09.26)

\ans136. It's true if $y\le x+\half$, because $f(x+t)-f(x)$ increases from
$f(t)$ to $-f(1-t)$ as $x$ increases from 0 to~$1-t$.
But it fails when $x<\half$ and $y=1$.
\endchange

\bye

[The next printing will be the 4th.]

not listed above:
page 168, line 4 had an extra space; I also inserted commas into lines 3&4
page 348 middle: delete commas in 22,032,015
remove "summation by parts" from the index

ARTICLES "TO APPEAR" THAT ARE STILL PENDING:
Fischetti, Salvagnin, ans 7.2.2.1--36 (arXiv:1907.08246 [cs.DS])
Harris's G4G9 presentation, ans 7.2.2.1--62
Beluhov snake-in-box knight paths, ans 7.2.2.1--173
Beluhov symmetric plane partitions and diamond/lozenge tilings, ans 7.2.2.1--261
% I wrote to Fischetti, Harris, Beluhov 22.07.23 asking for updates
Windsor's commafree codes? (I asked him Dec21 to tell me if he publishes)
Simkin arXiv 2107.13460 [ans 7.2.2--15]
Nobel,Agrawal,Boyd arXiv 2112.03336 about Simkin's constant [ans 7.2.2--15]