MathDB
Parititon of into three sets without consecutive integers

Source: Baltic Way 1995

October 8, 2011
inductioncombinatorics proposedcombinatorics

Problem Statement

In how many ways can the set of integers {1,2,…,1995}\{1,2,\ldots ,1995\} be partitioned into three non-empty sets so that none of these sets contains any pair of consecutive integers?
Back to ProblemsView on AoPS