Library / /21 of 151

, 2025

Combinatorics Difficulty 6.0 National Olympiad Find the answer Hungary

2025 light bulbs are operated by some switches. Each switch works on a subset of the light bulbs. When we use a switch, all the light bulbs in the subset change their state: bulbs that were on turn off, and bulbs that were off turn on. We know that every light bulb is operated by at least one of the switches. Initially, all lamps were off. Find the biggest number $k$ for which we can surely turn on at least $n$ light bulbs.

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.