A game is played as follows. N people are sitting around a table, each with one penny.  One person begins the game, takes one of his pennies (at this time, he happens to have exactly one penny) and passes it to the person to his left.  That second person then takes two pennies and passes them to the next person on the left.  The third person passes one penny, the fourth passes two, and so on, alternating passing one and two pennies to the next person. Whenever a person runs out of pennies, he is out of the game and has to leave the table. The game then continues with the remaining people.

A game is terminating if and only if it ends with just one person sitting at the table (holding all N pennies).  Show that there exists an infinite set of numbers for which the game is terminating.

Let’s say that a number is squarish if it is the product of two consecutive numbers.  For example, 6 is squarish, because it is 2*3.

A friend of mine at Microsoft recently had a birthday.  He said his age is now squarish.  Moreover, since the previous time his age was a squarish number, a squarish number of years has passed.  How many years would he have to wait until his age would have this property again?

A building has 16 rooms, arranged in a 4×4 grid.  There is a door between every pair of adjacent rooms (“adjacent” meaning north, south, west, and east, but no diagonals).  Only the room in the northeast corner has a door that leads out of the building.

In the initial configuration, there is one person in each room.  The person in the southwest corner is a psycho killer.  The psycho killer has the following traits:  If he enters a room where there is another person, he immediately kills that person .  But he also cannot stand the site of blood, so he will not enter any room where there is a dead person.

As it happened, from that initial configuration, the psycho killer managed to get out of the building after killing all the other 15 people.  What path did he take?

You have two jars.  One contains vinegar, the other oil.  The two jars contain the same amount of their respective fluid.

Take a spoonful of the vinegar and transfer it to the jar of oil.  Then, take a spoonful of liquid from the oil jar and transfer it to the vinegar jar.  Stir.  Now, how does the dilution of vinegar in the vinegar jar compare to the dilution of oil in the oil jar?

You’re given a procedure that with a uniform probability distribution outputs random numbers between 0 and 1 (to some sufficiently high degree of precision, with which we need not concern ourselves in this puzzle).  Using a bounded number of calls to this procedure, construct a procedure that with a uniform probability distribution outputs a random point within the unit circle.

Initially, you’re somewhere on the surface of the Earth.  You travel one kilometer South, then one kilometer East, then one kilometer North.  You then find yourself back at the initial position.  Describe all initial locations from which this is possible.

The games played in the soccer world championship form a binary tree, where only the winner of each game moves up the tree (ignoring the initial games, where the teams are placed into groups of 4, 2 of which of which go onto play in the tree of games I just described).  Assuming that the teams can be totally ordered in terms of how good they are, the winner of the championship will indeed be the best of all of the teams.  However, the second best team does not necessarily get a second place in the championship.  How many additional games need to be played in order to determine the second best team?

You’re given a 3x3x3 cube of cheese and a knife.  How many straight cuts with the knife do you need in order to divide the cheese up into 27 1x1x1 cubes?

You have 12 coins, 11 of which are the same weight and one counterfeit coin which has a different weight from the others.  You have a balance that in each weighing tells you whether the two sides are of equal weight, or which side weighs more.  How many weighings do you need to determine:  which is the counterfeit coin, and whether it weighs more or less than the other coins.  How?

A room has 100 light switches, numbered by the positive integers 1 through 100.  There are also 100 children, numbered by the positive integers 1 through 100.  Initially, the switches are all off.  Each child k enters the room and changes the position of every light switch n such that n is a multiple of k.  That is, child 1 changes all the switches, child 2 changes switches 2, 4, 6, 8, …, child 3 changes switches 3, 6, 9, 12, …, etc., and child 100 changes only light switch 100.  When all the children have gone through the room, how many of the light switches are on?