MathDB

2016 LMT Individual #20

Source:

April 10, 2016

Problem Statement

Find the number of partitions of the set

\{1,2,3,\cdots ,11,12\}

into three nonempty subsets such that no subset has two elements which differ by

1

.
Proposed by Nathan Ramesh