Congruences involving F-partition functions
The primary goal of this note is to prove the congruence ϕ3(3n+2)≡0(mod3), where ϕ3(n) denotes the number of F-partitions of n with at most 3 repetitions. Secondarily, we conjecture a new family of congruences involving cϕ2(n), the number of F-partitions of n with 2 colors.
Saved in:
Main Author: | James Sellers |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1994-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171294000256 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Congruences involving generalized Frobenius partitions
by: James Sellers
Published: (1993-01-01) -
Congruences modulo $4$ for the number of $3$-regular partitions
by: Ballantine, Cristina, et al.
Published: (2023-11-01) -
q-Analogue of a binomial coefficient congruence
by: W. Edwin Clark
Published: (1995-01-01) -
Recursive formulae for the multiplicative partition function
by: Jun Kyo Kim, et al.
Published: (1999-01-01) -
Congruences associated with families of nilpotent subgroups and a theorem of Hirsch
by: Aivazidis, Stefanos, et al.
Published: (2023-11-01)