Herzog Competition - 2012
Herzog Competition 2012
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
(OME) With many equal coins, build a triangle in the following way: place a coin, below it, place 2 coins touching it and themselves, below those 2 coins, place 3 coins touching the previous 2, and so on until you get a triangle filled with coins, whose sides consist of coins. Compute, in terms of , the total number of tangencies (touching points) among the coins in the triangle.
Problem 2
(OME) Let be three positive real numbers whose product is 1. Assume that the sum of these three numbers is greater than the sum of their reciprocals. Prove that exactly one of the three numbers is larger than 1.
Problem 3
(A-PMO) Show that for any positive integers and , the product cannot be a power of 2.
Problem 4
(H. Hu) The three complex numbers are the zeros of a polynomial , where and are complex numbers, and . The points corresponding to in the complex plane are the vertices of a right triangle with hypotenuse of length . Find . Recall that for a complex number , with and real, .
Problem 5
(Y. Wang) Prove the series
diverges.
Problem 6
(Putnam 1996) Show that for every positive integer ,