« Vrati se
In the coordinate plane consider the set S of all points with integer coordinates. For a positive integer k, two distinct points a, B\in S will be called k-friends if there is a point C\in S such that the area of the triangle ABC is equal to k. A set T\subset S will be called k-clique if every two points in T are k-friends. Find the least positive integer k for which there exits a k-clique with more than 200 elements.

Proposed by Jorge Tipe, Peru

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1939IMO Shortlist 1996 problem C41
2082IMO Shortlist 2001 problem G40
2134IMO Shortlist 2003 problem G37
2164IMO Shortlist 2004 problem G37
2185IMO Shortlist 2005 problem C43
2192IMO Shortlist 2005 problem G37