Observations on the Parity of the Total Number of Parts in Odd–part Partitions
نویسنده
چکیده
In recent years, numerous functions which count the number of parts of various types of partitions have been studied. In this brief note, we consider the function pto(n) which counts the number of parts in all odd–part partitions of n (or what Chen and Ji recently called the number of rooted partitions of n into odd parts). In particular, we prove a number of results on the parity of pto(n), including infinitely many Ramanujan–like congruences satisfied by the function.
منابع مشابه
Bijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed, which is closely related to Euler’s famous theorem that the number of partitions of n into odd parts equals the number of partitions of n into distinct parts. We consider extensions of Guy’s result, which naturally l...
متن کاملOn Stanley's Partition Function
Stanley defined a partition function t(n) as the number of partitions λ of n such that the number of odd parts of λ is congruent to the number of odd parts of the conjugate partition λ modulo 4. We show that t(n) equals the number of partitions of n with an even number of hooks of even length. We derive a closed-form formula for the generating function for the numbers p(n)− t(n). As a consequen...
متن کاملEuler's Partition Theorem with Upper Bounds on Multiplicities
We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m + 1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m. The first proof relies on two formulas with two parameters that are related to the four-parameter formulas of Boulet. We also give a combinatorial proof o...
متن کاملA note on partitions into distinct parts and odd parts
Bousquet-Mélou and Eriksson showed that the number of partitions of n into distinct parts whose alternating sum is k is equal to the number of partitions of n into k odd parts, which is a refinement of a well-known result by Euler. We give a different graphical interpretation of the bijection by Sylvester on partitions into distinct parts and partitions into odd parts, and show that the bijecti...
متن کاملBalanced Partitions
A famous theorem of Euler asserts that there are as many partitions of n into distinct parts as there are partitions into odd parts. We begin by establishing a less well-known companion result, which states that both of these quantities are equal to the number of partitions of n into even parts along with exactly one triangular part. We then introduce the characteristic of a partition, which is...
متن کامل