MathDB
Each expressible as n integers from different sets

Source: Baltic Way 2001

November 17, 2010
arithmetic sequencecombinatorics proposedcombinatorics

Problem Statement

Let n≥2n\ge 2 be a positive integer. Find whether there exist nn pairwise nonintersecting nonempty subsets of {1,2,3,…}\{1, 2, 3, \ldots \} such that each positive integer can be expressed in a unique way as a sum of at most nn integers, all from different subsets.
Back to ProblemsView on AoPS