Elementary formulas for integer partitions

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=1d Σi0 =1 d/k Σi1 =i0d- i0k-1 Σi2 =i1d- i0 - i1k-2 ... Σik-3=ik-4n- i0 - i1-i2- ...-ik-43 Σc|(d,i0,i1,i2,...,ik-3) μ(c) ( d-i0-i1-i2- ... ik-32c - ik-3-1c ). Our proofs are elementary.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…