Article
Licensed
Unlicensed
Requires Authentication
Integer Partitions into Arithmetic Progressions with an Odd Common Difference
-
Published/Copyright:
May 7, 2009
Abstract
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 equal to the number of odd divisors of n. This result is generalized by determining the number of partitions of n into arithmetic progressions with an odd common difference, including the case of a single term.
Keywords.: Integer partitions; arithmetic progression
Received: 2008-03-16
Accepted: 2009-02-21
Published Online: 2009-05-07
Published in Print: 2009-April
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On k-Imperfect Numbers
- On Universal Binary Hermitian Forms
- The Shortest Game of Chinese Checkers and Related Problems
- On Two-Point Configurations in a Random Set
- On Rapid Generation of SL2(𝔽q)
- Tiling Proofs of Some Formulas for the Pell Numbers of Odd Index
- Some new van der Waerden numbers and some van der Waerden-type numbers
- Integer Partitions into Arithmetic Progressions with an Odd Common Difference
- On Asymptotic Constants Related to Products of Bernoulli Numbers and Factorials
Articles in the same Issue
- On k-Imperfect Numbers
- On Universal Binary Hermitian Forms
- The Shortest Game of Chinese Checkers and Related Problems
- On Two-Point Configurations in a Random Set
- On Rapid Generation of SL2(𝔽q)
- Tiling Proofs of Some Formulas for the Pell Numbers of Odd Index
- Some new van der Waerden numbers and some van der Waerden-type numbers
- Integer Partitions into Arithmetic Progressions with an Odd Common Difference
- On Asymptotic Constants Related to Products of Bernoulli Numbers and Factorials
