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

HERZOG MATH COMPETITION

Note: The grading will be similar to the grading of Putnam. This means you must explain your answers/steps as much as possible. An answer without any explanation will receive no credit.

Problem 1

Let A = ( a i j ) Structured MathML transcription be an n × n Structured MathML transcription matrix such that ∑ j = 1 n | a i j | < 1 Structured MathML transcription for each i Structured MathML transcription . Prove that I n − A Structured MathML transcription is invertible. Here I n Structured MathML transcription is the n × n Structured MathML transcription identity matrix.

Problem 2

Prove that for any non-negative integer n Structured MathML transcription , the number

5 5 n + 1 + 5 5 n + 1 Structured MathML transcription
is not prime.

Problem 3

Let f : R → R Structured MathML transcription be a continuous function such that | f ( x ) − f ( y ) | ≥ | x − y | Structured MathML transcription for all x , y ∈ R Structured MathML transcription . Prove that the range of f Structured MathML transcription is all of R Structured MathML transcription .

Problem 4

Consider a circle of diameter AB and center O, and the tangent t at B. A variable tangent to the circle with contact point M intersects t at P. Find the locus of the point Q where the line OM intersects the parallel through P to the line AB.

Problem 5

A coin is tossed n Structured MathML transcription times. What is the probability that two heads will turn up in succession somewhere in the sequence?

Problem 6

Show that the number 2002 2002 Structured MathML transcription can be written as the sum of four perfect cubes, but not as the sum of three perfect cubes.