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 - 2016

Herzog Competition 2016

All problems are taken from outside sources, no claim of originality is made. 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! An answer without explanation will receive no credit. Have fun and may the algorithm be with you!

Problem 1

The numbers a 1 , a 2 , a 3 Structured MathML transcription are in arithmetic progression, and the numbers b 1 , b 2 , b 3 Structured MathML transcription are in geometric progression. We know that a 1 + b 1 = 85 Structured MathML transcription , a 2 + b 2 = 76 Structured MathML transcription , a 3 + b 3 = 84 Structured MathML transcription , and a 1 + a 2 + a 3 = 126 Structured MathML transcription . Find a 1 , a 2 , a 3 Structured MathML transcription and b 1 , b 2 , b 3 Structured MathML transcription .

Problem 2

Determine m Structured MathML transcription so that the equation in x Structured MathML transcription

x 4 − ( 3 m + 2 ) x 2 + m 2 = 0 Structured MathML transcription
has four real roots in arithmetic progression.

Problem 3

Little Marguerite is playing with little Inés, who became very good at multiplications and such (since the Herzog competition of 2014), and wants her to guess a number she wrote in a paper. So Marguerite tells Inés that the number n Structured MathML transcription is the smallest natural number n Structured MathML transcription which satisfies that

  • its decimal representation has a 6 as its last digit, and
  • if the last digit 6 is erased and placed in front of the remaining digits, the resulting number is four times as large as the original number n Structured MathML transcription .

How can little Inés find the number (only using mathematics and not cheating, of course)?

Problem 4

Given a circle of radius 1 and n Structured MathML transcription points P 1 , … , P n Structured MathML transcription in the plane, prove that there is a point M Structured MathML transcription on the circle such that | M P 1 | + ⋯ + | M P n | ≥ n Structured MathML transcription .

Problem 5

A rectangle in the plane with sides parallel to the x Structured MathML transcription and y Structured MathML transcription axes is partitioned into several smaller rectangles (which also have sides parallel to the axes). Each of the smaller rectangles has at least one side of integer length. Prove that the big rectangle has at least one side of integer length. (Note: “partition” means that the bigger rectangle is “cut” into the smaller rectangles, so that the union of all the smaller rectangles is the big rectangle, and the smaller rectangles do not overlap except possibly for touching sides or vertices.)

Problem 6

Evaluate ∑ n = 0 ∞ Arccot ⁡ ( n 2 + n + 1 ) Structured MathML transcription , where Arccot ⁡ ( t ) Structured MathML transcription for t ≥ 0 Structured MathML transcription denotes the number θ Structured MathML transcription in the interval 0 < θ ≤ π 2 Structured MathML transcription with cot θ = t Structured MathML transcription .