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

Herzog Prize Examination — 1975

Exam date: November 8, 1975

Problem 1

(Kelly) Prove that 2 2 n − 1 has at least n distinct prime divisors.

Problem 2

(McCoy) Let y 0 = 2 2 and recursively define

2 y n + 1 = 1 + y n

Compute

lim n → ∞ 4 n ( 1 − y n )

Problem 3

(D. Wright) In a large field there are thousands of gophers. Each gopher has his own hole and is within one yard of his hole. Suddenly a shot is fired and all gophers bolt for their holes. Show how each gopher may return to its hole staying at all times within 10 yards of his hole and yet never cross the path of any other gopher. (If you cannot do the problem with 10 yards try 1 mile, but remember that the field is very large).

Problem 4

(Sonneborn) Suppose a₁, a₂, ···, aₙ is a sequence of integers which takes on at most k distinct values. Prove that if n ≥ 2ᵏ then some product of consecutive aᵢ is a perfect square.

Problem 5

(Sled) Suppose f(x) is positive, continuously differentiable, and

0 < f(x²) + f′(x)

everywhere on [0,∞). Prove that

∫ 0 ∞ f(x) dx

diverges.

Problem 6

(Kelly) Prove that it is impossible to partition a rectangular box into a finite number of pairwise incongruent cubes with pairwise disjoint interiors.