ClassW04ApproxAlgs/ProofsGroupsExercises1

1. [induction, careful reasoning] Check out [the towers of hanoi puzzle]. Prove that to move N discs from one peg to another takes at least N moves.

---

2. [careful reasoning] On an island there are 200 people, half with brown eyes and half with blue eyes. The inhabitants follow the following customs without fail:

1. They never discuss eye color with each other.
2. Just before noon each day, all inhabitants meet silently at the top of a cliff. Any inhabitant that can prove to himself (or herself) that he (or she) has blue eyes,

screams and jumps off the cliff to his (or her) death at noon, in the presence of all other inabitants.

There are no reflecting surfaces in which any inhabitant can see his or her own eye color, so the only way each inhabitant gets information about his or her own eye color is by the behavior of the other inhabitants. On the other hand, it is common knowledge that each inhabitant knows the eye colors of all inhabitants other than him- or herself.

Things are stable until one day when a visitor comes to the noon meeting and announces in front of all inhabitants "There are blue-eyed people on this island."

|a) What happens, and when? (Hint: first consider what happens when there is only one blue-eyed person on the island, then two blue-eyed people...)

|b) State precisely what is wrong with the following argument:

   What the visitor said was already known.  Since no new information was provided,
   no new deductions are possible, and therefore the announcement changes nothing.
   So nothing happens.

---

3. [probabilistic method] Say a subset S of the non-negative integers is a pairwise cover if every positive integer i can be expressed as the sum of two integers in S. Define the density of S to be the function f where f(n) = |S∩ {1,2,…,n}|. Prove the existence of a pairwise cover whose density is o(n).

Hint: Generate a random S as follows: for each i independently, put i in S with some probability p(i). Show that with positive probability S is a pairwise cover with density o(n).

---

4. [being thorough] From the dynamic programming algorithm for knapsack, recall that A(i,p) was defined to be the minimum total size of any subset of the first i items giving total profit exactly p. We claimed the recurrence A(i,p) = min(A(i-1,p), A(i-1,p-p_i)+s_i for i > 0, and A(0,p) = ∞ for p > 0, and A(0,0)=0. Carefully prove that this recurrence is true.

---

Choose any statement that we claimed in class without proof, and give a careful proof.

Extra bonus points: add your proof to the appropriate [W04ApproxAlgs? page].

---

Find an interesting exercise of your own, and add it to this page.