科研之友
微信
新浪微博
Facebook
分享链接
摘要
A bipartition of n is an ordered pair of partitions (lambda, mu) such that the sum of all of the parts equals n. In this article, we concentrate on the function c(5)(n), which counts the number of bipartitions (lambda, mu) of n subject to the restriction that each part of mu is divisible by 5. We explicitly establish four Ramanujan type congruences and several infinite families of congruences for c(5)(n) modulo 3.
