Congruences involving generalized Frobenius partitions (Q1210476): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:32, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Congruences involving generalized Frobenius partitions |
scientific article |
Statements
Congruences involving generalized Frobenius partitions (English)
0 references
6 January 1994
0 references
The main result of this paper is a congruence involving the function \(\overline{c\varphi_m}(n)\) which denotes the number of generalized Frobenius partitions of \(n\) with \(m\) colors whose order is \(m\) under cyclic permutations of the \(m\) colors. L. W. Kolitsch has proved that for \(m\geq 2\) and all \(n\geq 1\), \(\overline{c\varphi_ m}(n)\equiv 0\pmod{m^2}\). The following is proved: For \(m=5, 7\) and \(11\) and for all \(n\geq 1\), \(\overline{c\varphi_ m}(n) \equiv 0\pmod{m^3}\).
0 references
congruence
0 references
generalized Frobenius partitions
0 references