olymmath

SIMON-MARAIS 2021 B2

  • Paper B

Let nn be a positive integer. There are nn lamps, each with a switch that changes the lamp from on to off, or from off to on, each time it is pressed. The lamps are initially all off. You are going to press the switches in a series of rounds. In the first round, you are going to press exactly 11 switch; in the second round, you are going to press exactly 22 switches; and so on, so that in the kk th round you are going to press exactly kk switches. In each round you will press each switch at most once. Your goal is to finish a round with all of the lamps switched on. Determine for which nn you can achieve this goal.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator simon-marais/2021/b2 · Tag 4TCZXYXWZR · Edit this page on GitHub · Keys: j next, k previous