English

Elementary formulas for integer partitions

Number Theory 2015-03-17 v1

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)=dnk=1di0=1d/ki1=i0di0k1i2=i1di0i1k2...ik3=ik4ni0i1i2...ik43c(d,i0,i1,i2,...,ik3)μ(c)(di0i1i2...ik32cik31c). 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})} \mu(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.

Keywords

Cite

@article{arxiv.1004.4849,
  title  = {Elementary formulas for integer partitions},
  author = {Mohamed El Bachraoui},
  journal= {arXiv preprint arXiv:1004.4849},
  year   = {2015}
}

Comments

5 pages

R2 v1 2026-06-21T15:15:33.076Z