MathDB
JBMO TST Moldova Problem 7

Source:

October 14, 2020
combinatorics

Problem Statement

There are written nn distinct positive integers. An operation is defined as follows: we chose two numers aa and bb written on the table; we erase them; we write at their places a+1a+1 and bāˆ’1b-1. Find the smallest value of the difference the biggest and the smallest written numbers after some operations.