Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-11-26T17:03:22.240Z Has data issue: false hasContentIssue false
  • English
  • Français

A Partition Theorem of Subbarao

Published online by Cambridge University Press:  20 November 2018

Hansraj Gupta
Hansraj Gupta*
Affiliation:
Panjab University, Chandigarh, India
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 17 , Issue 1 , 01 March 1974 , pp. 121 - 123
Copyright
Copyright © Canadian Mathematical Society 1974

References

1. Subbarao, M. V., On a partition theorem of MacMahon-Andrews, Proc. Amer. Math. Soc, 27 (1971), 449-450.Google Scholar
2. Gupta, H., On Sylvester's theorem in partitions, Indian Jour. Pure and Applied Maths., 2 (1971), 740-748.Google Scholar