Some congruences for 3-component multipartitions
Let p3(n) denote the number of 3-component multipartitions of n. Recently, using a 3-dissection formula for the generating function of p3(n), Baruah and Ojah proved that for n ≥ 0, p3(9n + 5) ≡ 0 (mod 33) and p3 (9n + 8) ≡ 0 (mod 34). In this paper, we prove several congruences modulo powers of 3 fo...
Main Authors: | Zhao Tao Yan, Jin Lily J., Gu C. |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2016-01-01
|
Series: | Open Mathematics |
Subjects: | |
Online Access: | http://www.degruyter.com/view/j/math.2016.14.issue-1/math-2016-0067/math-2016-0067.xml?format=INT |
Similar Items
-
Parity results for broken 11-diamond partitions
by: Wu Yunjian
Published: (2019-05-01) -
Ramanujan-type congruences modulo 4 for partitions into distinct parts
by: Merca Mircea
Published: (2022-09-01) -
Effective Congruences for Mock Theta Functions
by: Heidi Goodson, et al.
Published: (2013-09-01) -
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
by: Janczewski Robert, et al.
Published: (2018-02-01) -
A shorter proof of the distance energy of complete multipartite graphs
by: So Wasin
Published: (2017-01-01)