Abstract
The primary goal of this note is to prove the congruence ϕ3 (3n + 2) = 0 (mod 3), where ϕ3 (n) denotes the number of F-partitions of n with at most F repetitions. Secondarily, we conjecture a new family of congruences involving cϕ2 (n), the number of F-partitions of n with 2 colors.
Original language | English (US) |
---|---|
Pages (from-to) | 187-188 |
Number of pages | 2 |
Journal | International Journal of Mathematics and Mathematical Sciences |
Volume | 17 |
Issue number | 1 |
DOIs | |
State | Published - 1994 |
All Science Journal Classification (ASJC) codes
- Mathematics (miscellaneous)