MathDB
China Mathematical Olympiad 1994 problem2

Source: China Mathematical Olympiad 1994 problem2

September 17, 2013
pigeonhole principlecombinatorics unsolvedcombinatorics

Problem Statement

There are mm pieces of candy held in nn trays(n,m4n,m\ge 4). An operation is defined as follow: take out one piece of candy from any two trays respectively, then put them in a third tray. Determine, with proof, if we can move all candies to a single tray by finite operations.