MathDB
Problems
Contests
International Contests
Baltic Way
1995 Baltic Way
11
11
Part of
1995 Baltic Way
Problems
(1)
Parititon of into three sets without consecutive integers
Source: Baltic Way 1995
10/8/2011
In how many ways can the set of integers
{
1
,
2
,
…
,
1995
}
\{1,2,\ldots ,1995\}
{
1
,
2
,
…
,
1995
}
be partitioned into three non-empty sets so that none of these sets contains any pair of consecutive integers?
induction
combinatorics proposed
combinatorics