olymmath

KURSCHAK 1979

Kürschák Competition 1979.

Other problems

Problem 1

The base of a convex pyramid has an odd number of edges. The lateral edges of the pyramid are all equal, and the angles between neighbouring faces are all equal. Show that the base must be a regular polygon.

Problem 2

ff is a real-valued function defined on the reals such that f(x)≤xf(x) \le x and f(x+y)≤f(x)+f(y)f(x + y) \le f(x) + f(y) for all x,yx, y . Prove that f(x)=xf(x) = x for all xx .

Problem 3

An n×nn \times n array of letters is such that no two rows are the same. Show that it must be possible to omit a column, so that the remaining table has no two rows the same.