Integers on the board
$2016$ nonnegative integers are written on a board.In each step,you can erase two of the numbers and replace them with their sum and their difference.Is it possible,in a finite number of steps,to reach a state where at least $2015$ of the numbers are zero?
Last edited by tanmoy on Thu Oct 13, 2016 5:29 pm, edited 2 times in total.
"Questions we can't answer are far better than answers we can't question"
Re: Integers on the board
The problem actually has a mistake. The intended problem was, "Is it possible,in a finite number of steps,to reach a state where at least 2015 of the numbers are zero?"
Re: Integers on the board
Edited.Zawadx wrote:The problem actually has a mistake. The intended problem was, "Is it possible,in a finite number of steps,to reach a state where at least 2015 of the numbers are zero?"
"Questions we can't answer are far better than answers we can't question"