Since no one has solved the cute vector puzzle I heard, I'll repeat it here: << For some integer n > 0 you have all 2^n vectors of dimension n whose entries are +1 or -1. Of course the sum of all 2^n of these vectors is the 0 vector. Then your three-year-old child changes some of the entries of some of these vectors to 0. Show that there is still a nonempty subset of the new set of 2^n vectors that sums to the 0 vector.

...

Since there's been a lot of traffic on math-fun lately, maybe it's too early to post the solution, but I will soon. --Dan ________________________________________________________________________________________ It goes without saying that .