Vol. 120, No. 2, 1985

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Some Rogers-Ramanujan type partition theorems

M. V. Subba Rao

Vol. 120 (1985), No. 2, 431–435
Abstract

Analogous to the celebrated Rogers-Ramanujan partition theorems, we obtain four partition theorems wherein the minimal difference for ‘about the first half’ of the parts of a partition (arranged in non-increasing order of magnitude) is 2. For example, we prove that the number of partitions of n, such that the minimal difference of the ‘first half of the summands’ (that is, first [(t + 1)2] summands in a partition into t summands) of any partition is 2, equals the number of partitions n into summands congruent to ±1, ±2, ±5, ±6, ±8, ±9 (mod 20).

Mathematical Subject Classification
Primary: 11P57, 11P57
Secondary: 11P68
Milestones
Received: 1 October 1981
Revised: 23 August 1984
Published: 1 December 1985
Authors
M. V. Subba Rao