A Partition Theorem of Subbarao
Canadian mathematical bulletin, Tome 17 (1974) no. 1, pp. 121-123
Voir la notice de l'article provenant de la source Cambridge University Press
Let C(n) be the number of partitions of n such that all even multiplicities of the parts are less than 2m, m>1; and all odd multiplicities are at least (2r+1) and at most 2(m+r)—1, r≥0. Let D(n) be the number of partitions ofn into parts which are either odd multiples of (2r+1) or are even and not divisible by 2m.
Gupta, Hansraj. A Partition Theorem of Subbarao. Canadian mathematical bulletin, Tome 17 (1974) no. 1, pp. 121-123. doi: 10.4153/CMB-1974-023-8
@article{10_4153_CMB_1974_023_8,
author = {Gupta, Hansraj},
title = {A {Partition} {Theorem} of {Subbarao}},
journal = {Canadian mathematical bulletin},
pages = {121--123},
year = {1974},
volume = {17},
number = {1},
doi = {10.4153/CMB-1974-023-8},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1974-023-8/}
}
[1] 1. Subbarao, M. V., On a partition theorem of MacMahon-Andrews, Proc. Amer. Math. Soc, 27 (1971), 449-450. Google Scholar
[2] 2. Gupta, H., On Sylvester's theorem in partitions, Indian Jour. Pure and Applied Maths., 2 (1971), 740-748. Google Scholar
Cité par Sources :