Partitions into prime powers

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 k-th powers of primes (for fixed k). This combines Vaughan's work on partitions into primes with the author's previous result about partitions into k-th 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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…