olymmath

RU-ALLRUSSIAN 1991 Problem 11

  • Answer

The numbers 1, 2, 3, ..., n are written on a blackboard (where n≥3\mathrm{n} \geq 3 ). A move is to replace two numbers by their sum and non- negative difference. A series of moves makes all the numbers equal k. Find all possible k.

Answer all powers of 2≥n2 \geq \mathrm{n}

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2^m \geq n

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

Locator ru-allrussian/1991/p11 · Tag Q66JS5JCMV · Edit this page on GitHub · Keys: j next, k previous