Improving upon previous work  on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.
|Number of pages||11|
|Journal||Annals of Combinatorics|
|Early online date||5 Aug 2017|
|Publication status||Published - 1 Dec 2017|
- circle method
- parts in partitions