Problem

Source:

Tags: singapore, number theory, partition



Positive integers $m,n,k$ satisfy $1+2+3++...+n=mk$ and $m \ge n$. Show that we can partite $\{1,2,3,...,n \}$ into $k$ subsets (Every element belongs to exact one of these $k$ subsets), such that the sum of elements in each subset is equal to $m$.