February 1994
Intermediate to advanced
672 pages
18h 51m
English
book
Concrete Mathematics: A Foundation for Computer Science, 2nd Edition
by Ronald L. Graham, Donald E. Knuth, Oren Patashnik
Content preview from Concrete Mathematics: A Foundation for Computer Science, 2nd Edition
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
A
Answers to Exercises
Every exercise is answered here (at least briefly), and some of these answers go beyond what was asked. Readers will learn best if they make a serious attempt to find their own answers BEFORE PEEKING at this appendix.
The authors will be interested to learn of any solutions (or partial solutions) to the research problems, or of any simpler (or more correct) ways to solve the non-research ones.
(The first finder of every error in this book will receive a reward of $2.56.)
1.1 The proof is fine except when n = 2. If all sets of two horses have horses of the same color, the statement is true for any number of horses.
Does that mean I have to find every error?
1.2 If Xn is the number of moves, we have X0 = 0 and Xn = Xn–