Library / /56 of 151

, 2017

Combinatorics Difficulty 6.0 National Olympiad Prove it Hungary

Prove that among any ${\color{red}4097}$ distinct $0$ – $1$ sequences of length $24$ , there are two which differ from each other at no more than $7$ positions.

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.