MathDB
Good n-numbers - Iran NMO 1998 (Second Round) Problem3

Source:

October 4, 2010
combinatorics proposedcombinatorics

Problem Statement

Let nn be a positive integer. We call (a1,a2,,an)(a_1,a_2,\cdots,a_n) a good nn-tuple if i=1nai=2n\sum_{i=1}^{n}{a_i}=2n and there doesn't exist a set of aia_is such that the sum of them is equal to nn. Find all good nn-tuple. (For instance, (1,1,4)(1,1,4) is a good 33-tuple, but (1,2,1,2,4)(1,2,1,2,4) is not a good 55-tuple.)