Integers divded into 3 sets, with no consecutive integers
Source: Pan African MO 2006 Q5
May 1, 2013
countingdistinguishabilitycombinatorics unsolvedcombinatorics
Problem Statement
In how many ways can the integers from to be divided into three non-empty disjoint sets so that none of these sets contains a pair of consecutive integers?