MathDB

3 numbers written on blackboard

Source:

December 9, 2005

combinatorics proposedcombinatorics

Problem Statement

Three non-negative integers are written on a blackboard. A move is to replace two of the integers

k,m

k+m

and

|k-m|

. Determine whether we can always end with triplet which has at least two zeros