Maths Olympiad Prep

Library / /61 of 151

, 2026

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

20262026 people visited an exhibition where 10001000 paintings were displayed. Prove that it is possible to send some of the visitors to two rooms, with at least one visitor in each room, such that there is no painting that was liked by someone in one room but by nobody in the other, and there is no painting whose painter is personally known by someone in one room but by nobody in the other.

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.