olymmath

ISL 2016 N7

Let nn be an odd positive integer. In the Cartesian plane, a cyclic polygon PP with area SS is chosen. All its vertices have integral coordinates, and all squares of its side lengths are divisible by nn. Prove that 2S2 S is an integer divisible by nn.

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

Official text: IMO 2016 Shortlist booklet, page 13.

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/2016/n7 · Tag 8YFKE35B45 · Edit this page on GitHub · Keys: j next, k previous