Herzog Competition - 2009
Herzog Competition 2009
The grading will be harsh, because that is how the Putnam exam is graded. So make sure you justify as much as you can every step! Have fun and may the algorithm be with you!
Problem 1
(W. Brown & G. Ludden) Let , i.e. the plane. Let be a map that preserves distances (i.e. the distance between and is equal to the distance between and .) By distance we mean the usual distance (i.e. Euclidean distance.) Prove that is onto, i.e. that for every point in the plane, there is a point in the plane such that .
Problem 2
(IMTT, proposed by M. Shapiro) There are forty weights: 1, 2, . . . , 40 grams. Ten weights with even masses were put on the left pan of a scale. Then another ten weights with odd masses were put on the right pan of the scale. The left and right pans of the scale are now balanced. Prove that on one pan of the scales there are two weights with difference in mass of exactly 20 grams.
Problem 3
(P. Magyar) Define the Fibonacci sequence as , and in general, for . (So, e.g., , and so on.)
(a) Prove that every third Fibonacci number is even, and the rest are odd.
(b) More generally, prove that divides for any and positive integers.
Problem 4
(R. Shadrach) A battle ship is travelling on the number line. It starts at an unknown integer and moves at an unknown constant integer speed (integers per second.) You can fire a cannon once every second at an integer, destroying the ship if it is there. Come up with an algorithm for firing that is guaranteed to destroy the ship in a finite amount of time.
Problem 5
(Putnam 1965, proposed by Y. Wang) At a party, assume that no boy dances with every girl but each girl dances with at least one boy. Prove that there are two couples and which dance whereas doesn’t dance with and doesn’t dance with .
Problem 6
(Putnam 1966, proposed by Y. Wang) Let a convex polygon P be contained in a square of side one. Show that the sum of the squares of the sides of P is less than or equal to 4.