MathDB
Can 2001 numbers be all positive?

Source: Turkey TST 2001 - P1

April 5, 2013
functiongraph theorycombinatorics proposedcombinatorics

Problem Statement

Each one of 20012001 children chooses a positive integer and writes down his number and names of some of other 20002000 children to his notebook. Let AcA_c be the sum of the numbers chosen by the children who appeared in the notebook of the child cc. Let BcB_c be the sum of the numbers chosen by the children who wrote the name of the child cc into their notebooks. The number Nc=AcBcN_c = A_c - B_c is assigned to the child cc. Determine whether all of the numbers assigned to the children could be positive.