# Partitions into kth powers of terms in an arithmetic progression

Partitions into kth powers of terms in an arithmetic progression Math. Z. https://doi.org/10.1007/s00209-018-2063-8 Mathematische Zeitschrift Partitions into kth powers of terms in an arithmetic progression 1 1,3 Bruce C. Berndt · Amita Malik · 1,2 Alexandru Zaharescu Received: 26 June 2016 / Accepted: 9 March 2018 © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract G. H. Hardy and S. Ramanujan established an asymptotic formula for the number of unrestricted partitions of a positive integer, and claimed a similar asymptotic formula for the number of partitions into perfect kth powers, which was later proved by E. M. Wright. Recently, R. C. Vaughan provided a simpler asymptotic formula in the case k = 2. In this paper, we consider partitions into parts from a speciﬁc set A (a , b ) := k 0 0 m : m ∈ N, m ≡ a (mod b ) , for ﬁxed positive integers k, a , and b .Wegiveanasymp- 0 0 0 0 totic formula for the number of such partitions, thus generalizing the results of Wright and Vaughan. Moreover, we prove that the number of such partitions is even (odd) inﬁnitely often, which generalizes O. Kolberg’s theorem for the ordinary partition function p(n). Keywords Partitions · Parity · Arithmetic progression http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematische Zeitschrift Springer Journals

# Partitions into kth powers of terms in an arithmetic progression

, Volume OnlineFirst – May 29, 2018
31 pages

/lp/springer_journal/partitions-into-kth-powers-of-terms-in-an-arithmetic-progression-gTw9qtScTe
Publisher
Springer Berlin Heidelberg
Subject
Mathematics; Mathematics, general
ISSN
0025-5874
eISSN
1432-1823
D.O.I.
10.1007/s00209-018-2063-8
Publisher site
See Article on Publisher Site

### Abstract

Math. Z. https://doi.org/10.1007/s00209-018-2063-8 Mathematische Zeitschrift Partitions into kth powers of terms in an arithmetic progression 1 1,3 Bruce C. Berndt · Amita Malik · 1,2 Alexandru Zaharescu Received: 26 June 2016 / Accepted: 9 March 2018 © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract G. H. Hardy and S. Ramanujan established an asymptotic formula for the number of unrestricted partitions of a positive integer, and claimed a similar asymptotic formula for the number of partitions into perfect kth powers, which was later proved by E. M. Wright. Recently, R. C. Vaughan provided a simpler asymptotic formula in the case k = 2. In this paper, we consider partitions into parts from a speciﬁc set A (a , b ) := k 0 0 m : m ∈ N, m ≡ a (mod b ) , for ﬁxed positive integers k, a , and b .Wegiveanasymp- 0 0 0 0 totic formula for the number of such partitions, thus generalizing the results of Wright and Vaughan. Moreover, we prove that the number of such partitions is even (odd) inﬁnitely often, which generalizes O. Kolberg’s theorem for the ordinary partition function p(n). Keywords Partitions · Parity · Arithmetic progression

### Journal

Mathematische ZeitschriftSpringer Journals

Published: May 29, 2018

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just \$49/month

### Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

### Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

### Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

### Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

DeepDyve

DeepDyve

### Pro

Price

FREE

\$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations