olymmath

KURSCHAK 1991

Kürschák Competition 1991.

Other problems

Problem 1

Let nn be a positive integer, and a,b≥1a,b\ge 1 , c>0c>0 arbitrary real numbers. Prove that

(ab+c)n−c(b+c)n−c≤an.\frac{(ab+c)^n-c}{(b+c)^n-c}\le a^n.

Problem 2

A convex polyhedron has two triangle and three quadrilateral faces. Connect every vertex of one of the triangle faces with the intersection point of the diagonals in the quadrilateral face opposite to it. Show that the resulting three lines are concurrent.

Problem 3

Consider 998998 red points on the plane with no three collinear. We select kk blue points in such a way that inside each triangle whose vertices are red points, there is a blue point as well. Find the smallest kk for which the described selection of blue points is possible for any configuration of 998998 red points.