当前位置: X-MOL 学术Ramanujan J. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
New congruences modulo 2, 4, and 8 for the number of tagged parts over the partitions with designated summands
The Ramanujan Journal ( IF 0.7 ) Pub Date : 2019-03-21 , DOI: 10.1007/s11139-018-0112-x
Nayandeep Deka Baruah , Mandeep Kaur

Recently, Lin introduced two new partition functions \(\hbox {PD}_{\mathrm{t}}(n)\) and \(\hbox {PDO}_{\mathrm{t}}(n)\), which count the total number of tagged parts over all partitions of n with designated summands and the total number of tagged parts over all partitions of n with designated summands in which all parts are odd. Lin also proved some congruences modulo 3 and 9 for \(\hbox {PD}_{\mathrm{t}}(n)\) and \(\hbox {PDO}_{\mathrm{t}}(n)\), and conjectured some congruences modulo 8. In this paper, we prove the congruences modulo 8 conjectured by Lin and also find many new congruences and infinite families of congruences modulo some small powers of 2.

中文翻译:

具有指定求和数的分区上标记部分的数量的模2、4和8的新同余

最近,Lin引入了两个新的分区函数\(\ hbox {PD} _ {\ mathrm {t}}(n)\)\(\ hbox {PDO} _ {\ mathrm {t}}(n)\),它计算具有指定加数的n个所有分区上的标记部分的总数,以及具有指定加数的n个所有分区中所有部分都是奇数的标记部分的总数。Lin还证明了\(\ hbox {PD} _ {\ mathrm {t}}(n)\)\(\ hbox {PDO} _ {\ mathrm {t}}(n)\模3和9的等价性,并猜想出一些等式8。在本文中,我们证明了Lin猜想的等式8,并且还发现了许多新的等式和2的幂次幂的无穷大。
更新日期:2019-03-21
down
wechat
bug