Two congruences involving Andrews-Paule's broken 3-diamond partitions and 5-diamond partitions
Two congruences involving Andrews-Paule's broken 3-diamond partitions and 5-diamond partitions
复制标题
DOI:
10.3792/pjaa.87.65
复制
发表时间:
2010-06
期刊:
影响因子:
--
通讯作者:
Xinhua Xiong
中科院分区:
文献类型:
--
作者:
Xinhua Xiong
AbstractIn this note, we will give proofs of two congruences involving broken 3-diamond parti-tions and broken 5-diamond partitions which were conjectured by Peter Paule and SilviuRadu. 1 Introduction In 2007 Gorges E.AndrewsandPeter Paule [1] introduced a newclass of combinatorial objectscalled broken k-diamonds. Let ∆ k (n) denote the number of broken k-diamond partitions ofn, then they showed thatX ∞n=0 ∆ k (n)q n =Y ∞n=1 (1 −q 2n )(1 −q (2k+1)n )(1 −q n ) 3 (1 −q (4k+2)n ).In 2008 Song Heng Chan [3] proved an infinite family of congruences when k = 2, in 2009Peter Paule and Silviu Radu [10] gave two non-standard infinite families of broken 2-diamondcongruences. Moreover they stated four conjectures related to broken 3-diamond partitionsand 5-diamond partitions. In this note we show that their first conjecture and the thirdconjecture are true:Theorem 1.1 ( [10], Conjecture 3.1).Y ∞n=1 (1 −q n ) 4 (1 −q 2n ) 6 ≡ 6X ∞n=0 ∆ 3 (7n +5)q n (mod 7).Theorem 1.2 ( [10], Conjecture 3.3).E 4 (q 2