Open Mathematics (Jan 2016)

Some congruences for 3-component multipartitions

  • Zhao Tao Yan,
  • Jin Lily J.,
  • Gu C.

DOI
https://doi.org/10.1515/math-2016-0067
Journal volume & issue
Vol. 14, no. 1
pp. 783 – 788

Abstract

Read online

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 for p3(n) by using some theta function identities. For example, we prove that for n ≥ 0, p3 (243n + 233) ≡ p3 (729n + 638) ≡ 0 (mod 310).

Keywords