Library / /88 of 151
, 2023
Combinatorics Difficulty 7.0 National Olympiad, round 2 Prove it Hungary
Let (ai,bi) be pairwise distinct pairs of positive integers for 1≤i≤n. Prove that
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.