| MSC: | 05A17 | Partitions of integers |
| 11P81 | Elementary theory of partitions | |
| ZDM: | - | |
| CR: | - | |
| PACS: | - |
Abstract:
Every number not in the form 2\textsuperscript{k} can be partitioned into two or more consecutive parts.
Thomas E. Mason has shown that the number of ways in which a number n
may be partitioned into consecutive parts, including the case of a single term, is the number
of odd divisors of n. This result is generalized by determining the number of partitions of n
into arithmetic progressions with a common difference r, including the case of a single term.