O'Reilly logo

Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1 by Donald E. Knuth

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Answers to Exercises

Answer not a fool according to his folly,lest thou also be like unto him.

— Proverbs 26:4

Notes on the Exercises

1. A moderately easy problem for a mathematically inclined reader.

2. The author will reward you if you are first to report an error in the statement of an exercise or in its answer, assuming that he or she is suitably sagacious.

3. See H. Poincaré, Rendiconti Circ. Mat. Palermo 18 (1904), 45–110; R. H. Bing, Annals of Math. (2) 68 (1958), 17–37; G. Perelman, arXiv:math/0211159 [math.DG], arXiv:math/0303109 [math.DG], arXiv:math/0307245 [math.DG].

Section 7

1. Following the hint, we’ll want the second ‘4m−4’ to be immediately followed by the first ‘2m – 1’. The desired arrangements can be deduced from the first ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required