Elementary formulas for integer partitions

preprint2010arXivOpen access

Abstract

In this note we will give various exact formulas for functions on integer partitions including the functions p(n)p(n) and p(n,k)p(n,k) of the number of partitions of nn and the number of such partitions into exactly kk parts respectively. For instance, we shall prove that p(n)=∑d∣n∑k=1d∑i0=1⌊d/k⌋∑i1=i0⌊d−i0k−1⌋∑i2=i1⌊d−i0−i1k−2⌋...∑ik−3=ik−4⌊n−i0−i1−i2−...−ik−43⌋∑c∣(d,i0,i1,i2,...,ik−3)μ(c)(⌊d−i0−i1−i2−...ik−32c⌋−⌊ik−3−1c⌋). p(n) = \sum_{d|n} \sum_{k=1}^{d} \sum_{i_0 =1}^{\lfloor d/k \rfloor} \sum_{i_1 =i_0}^{\lfloor\frac{d- i_0}{k-1} \rfloor} \sum_{i_2 =i_1}^{\lfloor\frac{d- i_0 - i_1}{k-2} \rfloor} ... \sum_{i_{k-3}=i_{k-4}}^{\lfloor\frac{n- i_0 - i_1-i_2- ...-i_{k-4}}{3} \rfloor} \sum_{c|(d,i_0,i_1,i_2,...,i_{k-3})} μ(c) (\lfloor \frac{d-i_0-i_1-i_2- ... i_{k-3}}{2c} \rfloor - \lfloor\frac{i_{k-3}-1}{c} \rfloor). Our proofs are elementary.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.