Abstract
A famous theorem of Euler asserts that there are as many partitions of n into distinct parts as there are partitions into odd parts. The even parts in partitions of n into distinct parts play an important role in the Euler–Glaisher bijective proof of this result. In this paper, we investigate the number of even parts in all partitions of n into distinct parts providing new combinatorial interpretations for this number.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. E. Andrews, The theory of partitions, Cambridge Mathematical Library, Reprint of the 1976 original Cambridge University Press, Cambridge, 1998.
G. E. Andrews, The number of smallest parts in the partitions of \(n\) J. Reine Angew. Math. 624 (2008), 133–142.
G. E. Andrews and M. Merca, The truncated pentagonal number theorem J. Comb. Th., Ser. A 119 (2012), 1639–1643.
G. E. Andrews and M. Merca, Truncated theta series and a problem of Guo and Zeng J. Comb. Th., Ser. A 154 (2018), 610–619.
R. Fokkink, W. Fokkink and B. Z. Wang, A Relation Between Partitions and the Number of Divisors Amer. Math. Monthly 102 (1995), 345–347.
M. Merca, The Lambert series factorization theorem Ramanujan J 44 (2017), 417–435.
N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences Published electronically at http://oeis.org
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Andrews, G.E., Merca, M. On the Number of Even Parts in All Partitions of \(\varvec{n}\) into Distinct Parts. Ann. Comb. 24, 47–54 (2020). https://doi.org/10.1007/s00026-019-00479-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-019-00479-y