Partitions into kth powers of terms in an arithmetic progression

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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k=2$$\end{document}. In this paper, we consider partitions into parts from a specific set Ak(a0,b0):=mk:m∈N,m≡a0(modb0)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A_k(a_0,b_0) :=\left\{ m^k : m \in \mathbb {N} , m \equiv a_0 \,(\text {mod}\,b_0) \right\} $$\end{document}, for fixed positive integers k, a0,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a_0,$$\end{document} and b0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b_0$$\end{document}. We give an asymptotic 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) infinitely often, which generalizes O. Kolberg’s theorem for the ordinary partition function p(n).