On the Number of Even Parts in All Partitions of n into Distinct Parts

被引:0
作者
Andrews, George E. [1 ]
Merca, Mircea [2 ]
机构
[1] Penn State Univ, Dept Math, Univ Pk, State Coll, PA 16802 USA
[2] Acad Romanian Scientists, Ilfov 3,Sect 5, Bucharest, Romania
关键词
Combinatorial identity; Euler's partition identity; Partitions;
D O I
10.1007/s00026-019-00479-y
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:47 / 54
页数:8
相关论文
共 7 条
[1]  
Andrews GE., 1998, THEORY PARTITIONS
[2]   Truncated theta series and a problem of Guo and Zeng [J].
Andrews, George E. ;
Merca, Mircea .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2018, 154 :610-619
[3]   The truncated pentagonal number theorem [J].
Andrews, George E. ;
Merca, Mircea .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2012, 119 (08) :1639-1643
[4]   The number of smallest parts in the partitions of n [J].
Andrews, George E. .
JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 2008, 624 :133-142
[5]   The Lambert series factorization theorem [J].
Merca, Mircea .
RAMANUJAN JOURNAL, 2017, 44 (02) :417-435
[6]  
Sloane N.J.A., The on-line encyclopedia of integer sequences (A007323), DOI DOI 10.1371/journal.pone.0096223
[7]  
WANG ZB, 1995, AM MATH MON, V102, P345