Extension of Stanley's Theorem for Partitions

TL;DR

This paper extends Stanley's theorem to relate the sum of distinct members in partitions to the total occurrences of any number k, and generalizes Ramanujan's congruence results for partition functions.

Contribution

It introduces a generalized relation involving the occurrences of any number k in partitions and extends Ramanujan's congruence results to these occurrences.

Findings

Generalized Stanley's theorem for any number k in partitions.

Derived new congruence properties for the number of occurrences of k.

Provided alternative proofs for classical partition theorems.

Abstract

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and "the total number of 1's that occur in the partitions of $n$". Our generalization states a similar relation between "the sum of the numbers of distinct members in the partitions of $n$" and the total number of 2's or 3's or any general $k$ that occur in the partitions of $n$ and the subsequent integers. We also apply this result to obtain an array of interesting corollaries, including alternate proofs and analogues of some of the very well-known results in the theory of partitions. We extend Ramanujan's results on congruence behavior of the 'number of partition' function $p(n)$ to get analogous results for the 'number of occurrences of an element $k$ in partitions of $n$'. Moreover, we present an alternate proof of Ramanujan's results in this paper.