Largest and smallest maximal sets of pairwise disjoint partitions (Q1839274)

The problem can be stated in the following form: In a pack of \(n\) cards, the first card is marked 1, the second 2, the third 3, \(\ldots\), and the \(n\)-th \(n\). One takes out a given number \(t\) \((>1)\) of cards from the pack, so that the sum of the markings on the cards is \(n\). The selected cards are then put aside. Every time one does this, it is said to have made a trick. We are required to find the largest number \(M_t(n)\) of tricks that one can make in this manner and also the smallest number \(_mt(n)\) of tricks that can be so made. In this paper the author proves that \[ M_t(n) = \left[\frac{2n-t}{t^2}\right],\quad t\ge 2; \tag{1} \] where the square brackets denote as usual the greatest integer function, and \[ \frac{(t -1)n}{t(t^2 - 2t +2} - \frac{t^2 - 2t -1}{t^2 - 2t +2} < m_t(n)< \frac{2n + (t - 1)(t - 2)}{2t(t - 1)}; \quad t\ge 3. \tag{2} \] The reader will do well to see also the reviewer's proof of (1) [J. Pure Appl. Math. 12, 1293--1298 (1981; Zbl 0468.10008)]. The reviewer has also been able to find a simple way of selecting the \(t\) cards so that the game will end with exactly \[ k = \left[ \frac{2n + (t - 1) (t - 2) - 1}{2t (t - 1)} \right], \quad t\ge 2; \tag{3} \] tricks, except when \(t =3\) and \(n\) is of the form \(6r\), \(r\ge 2\). In the exceptional case, Richard H. Reis (Professor of English, at Marion, Mass., USA), has found an arrangement where the game ends with \(k - 1\) tricks, with \(k\) as in (3).