olymmath

KURSCHAK 1995

Kürschák Competition 1995.

Other problems

Problem 1

Given in the plane is a lattice and a grid rectangle with sides parallel to the coordinate axes. We divide the rectangle into grid triangles with area 12\frac12 . Prove that the number of right angled triangles is at least twice as much as the shorter side of the rectangle.

(A grid polygon is a polygon such that both coordinates of each vertex is an integer.)

Problem 2

Consider a polynomial in nn variables with real coefficients. We know that if every variable is ±1\pm1 , the value of the polynomial is positive, or negative if the number of −1-1 's is even, or odd, respectively. Prove that the degree of this polynomial is at least nn .

Problem 3

Points AA , BB , CC , DD are such that no three of them are collinear. Let E=AB∩CDE=AB\cap CD and F=BC∩DAF=BC\cap DA . Let k1k_1 , k2k_2 and k3k_3 denote the circles with diameter AC‾\overline{AC} , BD‾\overline{BD} and EF‾\overline{EF} , respectively. Prove that either k1,k2,k3k_1,k_2,k_3 pass through one point, or no two of them intersect.