Partition of a set of integers into subsets with prescribed sums (Q2493636)

A nonincreasing sequence of positive integers \(\langle m_1, m_2, \ldots, m_k \rangle\) is said to be \(n\)-realizable if the set \(I_n = \{ 1, 2, \ldots, n\}\) can be partitioned into \(k\) mutually disjoint sunsets \(S_1, S_2, \ldots, S_k\) such that \(\sum_{x \in S_i} x = m_i\) for each \(i\), \(1 \leq i \leq k\). The authors show that if a nonincreasing sequence of positive integers \(\langle m_1, m_2, \ldots, m_k \rangle\) satisfies \(\sum_{i=1}^k m_i = \) \(n \choose 2\) and \(m_{k-1} \geq n\), then this sequence is \(n\)-realizable. Moreover, they illustrate that this result cannot be improved by replacing the latter condition with \(m_{k-2} \geq n\).