Conjecture: Let $n$ $∈$ $N$. Then for each factor $m ≥ n$ of $n$($n + 1$)/$2$, one can partition the set $\{1, 2, 3, \ldots , n\}$ into disjoint subsets such that the sum of elements in each subset is equal to $m$.
The conjecture is based on numerical evidence.
