A congruence for \(c{\varphi{}}_{h,k}(n)\) (Q1209555): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1216/rmjm/1181072705 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1216/rmjm/1181072705 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1980885871 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of a congruence by Andrews for generalized Frobenius partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3822240 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3822242 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1216/RMJM/1181072705 / rank | |||
Normal rank |
Latest revision as of 16:16, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A congruence for \(c{\varphi{}}_{h,k}(n)\) |
scientific article |
Statements
A congruence for \(c{\varphi{}}_{h,k}(n)\) (English)
0 references
16 May 1993
0 references
Let \(c\varphi_{h,k}(n)\) be the number of generalized Frobenius partitions of \(n\) with \(h\) colors and at most \(k\) repetitions, as introduced by \textit{Padmavathamma} [Fibonacci Q. 27, 125-130 (1989; Zbl 0669.10025)]. It is proved that \[ \sum_{d\mid(h,n)} \mu(d) c\varphi_{h/d,k}(n/d)\equiv 0\pmod{hH}, \] where \(H\) is the product of all the prime power factors of \(h\) which are relatively prime to \(k+1\). As an immediate corollary, \[ \sum_{d\mid(h,n)}\mu(d)c\varphi_{h/d,k}(n/d)\equiv 0\pmod h^ 2 \] if \((h,k+1)=1\).
0 references
congruence
0 references
generalized Frobenius partitions
0 references
colors
0 references
repetitions
0 references