Maths Olympiad Prep

Library / /106 of 151

, 2024

Combinatorics Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

A non self-intersecting polygon is given in a Cartesian coordinate system such that its perimeter contains no lattice points, and its vertices have no integer coordinates. A point is called semi-integer if exactly one of its coordinates is an integer. Let P1P_1, P2P_2, \ldots, PkP_k denote the semi-integer points on the perimeter of the polygon. Let nin_i denote the floor of the non-integer coordinate of PiP_i. Prove that integers n1,n2,,nkn_1, n_2, \ldots , n_k can be divided into two groups with the same sum.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.