Concrete Mathematics - Recurrent Problems - (1)

Concrete Mathematics is book written by Donald E. Knuth. It is a nice book for programmers and computer science students. Actually I seldom read mathematic books, for it needs patience. But I really like the writting style of Knuth that is full of interest and humor. Exercises in the book are really big difficult for me, as I have lost all my mathematics execpt that was learned in high school. However, I want to get my hands in those exercises and see how many I can solve at my best try.

Chapter One: Recurrent Problems

Warmups

1. All horses are the same color; we can prove this by induction on the number of horses in a given set. Here's how: " If there's just one horse then it's the same color as itself, so the basis is trivial. For the induction step, assume that there are n horses numbered 1 to n. By the induction hypothe