✦ LIBER ✦

On the number of partitions of n into k different parts

✍ Scribed by Byungchan Kim

Book ID: 113731132
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 138 KB
Volume: 132
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2012.01.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of smallest parts in the part

The number of smallest parts in the partitions of n

✍ Andrews, George E. 📂 Article 📅 2008 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 107 KB

Algorithm for numbering the partitions o

Algorithm for numbering the partitions of n into m parts

✍ B. M. Zlotnik 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 250 KB

The 2-Adic Behavior of the Number of Par

The 2-Adic Behavior of the Number of Partitions into Distinct Parts

✍ Ken Ono; David Penniston 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Let Q(n) denote the number of partitions of an integer n into distinct parts. For positive integers j, the first author and B. Gordon proved that Q(n) is a multiple of 2 j for every non-negative integer n outside a set with density zero. Here we show that if i 0 (mod 2 j ), then In particular, Q(n)

Identities relating the number of partit

Identities relating the number of partitions into an even and odd number of parts

✍ Dean R Hickerson 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 94 KB

On the number of partitions into primes

✍ R. C. Vaughan 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 316 KB

Formulæ for the number of partitions of

Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)

✍ Andrew V. Sills; Doron Zeilberger 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 131 KB