Sums of consecutive integers and a partition identity of Sylvester

In 1882, Sylvester published a beautiful refinement of Euler's theorem that the number of partitions of a positive integer into odd integers equals the number of partitions into distinct integers. We will prove Sylvester's theorem, and apply it to the problem of representing integers as sums of finite arithmetic progressions.

Mel Nathanson