Nordic 2009 Problem
Source:
March 23, 2011
combinatorics unsolvedcombinatorics
Problem Statement
The integers , , , , and are written on a blackboard. It is allowed to wipe out two integers and and replace them with and . Is it possible, by repeating this procedure, to reach a situation where three of the five integers on the blackboard are ?