A Result Concerning Sequences of Integers

Extract

1. In a recent issue of the American Mathematical Monthly, L. Moser proved the following result:

If an enthusiastic problemist proposes at least one problem every day, but never more than 730 in any calendar year (not even in a leap year), then, given any positive integer n, there is some set of consecutive days in which he proposes a total of exactly n problems.