Abstract
For a subset A ⊂ N , let p A ( n ) denote the restricted partition function which counts partitions of n with all parts lying in A. In this paper, we use a variation of the Hardy–Littlewood circle method to provide an asymptotic formula for p A ( n ) , where A is the set of kth powers of primes (for fixed k). This combines Vaughan's work on partitions into primes with the author's previous result about partitions into kth powers. This new asymptotic formula is an extension of a pattern indicated by several results about restricted partition functions over the past few years. Comparing these results side-by-side, we discuss a general strategy by which one could analyze p A ( n ) for a given set A.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
