Congruences involving F-partition functions (Q1321871): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2144438851 / rank | |||
Normal rank |
Latest revision as of 10:28, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Congruences involving F-partition functions |
scientific article |
Statements
Congruences involving F-partition functions (English)
0 references
17 October 1999
0 references
Summary: The primary goal of this note is to prove the congruence \(\phi_3(3n+ 2)\equiv 0\pmod 3\), where \(\phi_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\phi_2(n)\), the number of F-partitions of \(n\) with 2 colors.
0 references
partitions
0 references
congruence
0 references