Display Accessibility Tools

Accessibility Tools

Grayscale

Highlight Links

Change Contrast

Increase Text Size

Increase Letter Spacing

Readability Bar

Dyslexia Friendly Font

Increase Cursor Size

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 n coins. Compute, in terms of n , the total number of tangencies (touching points) among the coins in the triangle.

Problem 2

(OME) Let a , b , c 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 a and b , the product ( 36 a + b ) ( a + 36 b ) cannot be a power of 2.

Problem 4

(H. Hu) The three complex numbers a , b , c are the zeros of a polynomial P ( z ) = z 3 + q z + r , where q and r are complex numbers, and | a | 2 + | b | 2 + | c | 2 = 250 . The points corresponding to a , b , c in the complex plane are the vertices of a right triangle with hypotenuse of length h . Find h 2 . Recall that for a complex number z = x + i y , with x and y real, | z | 2 = x 2 + y 2 .

Problem 5

(Y. Wang) Prove the series

∑ n = 2 ∞ ( log n ) − log log n

diverges.

Problem 6

(Putnam 1996) Show that for every positive integer n ,

( 2 n − 1 e ) 2 n − 1 2 < 1 · 3 · 5 ⋯ ( 2 n − 1 ) < ( 2 n + 1 e ) 2 n + 1 2