olymmath

ISL 2008 C3

In the coordinate plane consider the set SS of all points with integer coordinates. For a positive integer kk, two distinct points A,B∈SA, B \in S will be called kk-friends if there is a point C∈SC \in S such that the area of the triangle ABCA B C is equal to kk. A set T⊂ST \subset S will be called a kk-clique if every two points in TT are kk-friends. Find the least positive integer kk for which there exists a kk-clique with more than 200 elements.

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2008 Shortlist booklet, page 25.

Show the answer

180180

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2008/c3 · Tag K8W19JMNP8 · Edit this page on GitHub · Keys: j next, k previous