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) and p(n,k) of the number of partitions of n and the number of such partitions into exactly k parts respectively. For instance, we shall prove that p(n)=d∣n∑k=1∑di0=1∑⌊d/k⌋i1=i0∑⌊k−1d−i0⌋i2=i1∑⌊k−2d−i0−i1⌋...ik−3=ik−4∑⌊3n−i0−i1−i2−...−ik−4⌋c∣(d,i0,i1,i2,...,ik−3)∑μ(c)(⌊2cd−i0−i1−i2−...ik−3⌋−⌊cik−3−1⌋). Our proofs are elementary.
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