olymmath

KURSCHAK 2001

Kürschák Competition 2001.

Other problems

Problem 2

Let k≥3k\ge 3 be an integer. Prove that if n>(k3)n>\binom k3 , then for any 3n3n pairwise different real numbers ai,bi,cia_i,b_i,c_i ( 1≤i≤n1\le i\le n ), among the numbers ai+bia_i+b_i , ai+cia_i+c_i , bi+cib_i+c_i , one can find at least k+1k+1 pairwise different numbers. Show that this is not always the case when n=(k3)n=\binom k3 .

Problem 3

In a square lattice let us take a lattice triangle that has the smallest area among all the lattice triangles similar to it. Prove that the circumcenter of this triangle is not a lattice point.