George E Andrews derived formula for the number of smallest parts of partitions of a positive integer n. In this paper we derived the generating function for the number of smallest parts of all partitions of n utilizing r-partitions of n. We also derive the generating function for Ac(n) , the number of smallest parts of the partitions of n which are multiples of c and also to evaluate the sum of smallest parts of partitions of n by applying the concept of r-partitions of n
AbstractWe study the number of partitions of n into k different parts by constructing a generating f...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
A partition of a positive number n is a representation of this number as a sum of natural numbers, c...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
For P(n,k) equal to the partitions of n into k parts, in probability related investigations, it coul...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
A partition is a way that a number can be written as a sum of other numbers. For example, the number...
AbstractAn M-partition of a positive integer m is a partition of m with as few parts as possible suc...
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
Several algorithms for generating partitions of positive numbers are given. First, an algorithm for...
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
In 2013, Andrews, Garvan and Liang defined Self-conjugate S-partitions. In 2011, Andrews stated the ...
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. O...
AbstractWe study the number of partitions of n into k different parts by constructing a generating f...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
A partition of a positive number n is a representation of this number as a sum of natural numbers, c...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
For P(n,k) equal to the partitions of n into k parts, in probability related investigations, it coul...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
A partition is a way that a number can be written as a sum of other numbers. For example, the number...
AbstractAn M-partition of a positive integer m is a partition of m with as few parts as possible suc...
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
Several algorithms for generating partitions of positive numbers are given. First, an algorithm for...
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
In 2013, Andrews, Garvan and Liang defined Self-conjugate S-partitions. In 2011, Andrews stated the ...
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. O...
AbstractWe study the number of partitions of n into k different parts by constructing a generating f...
AbstractAn M-partition of a positive integer m is a partition with as few parts as possible such tha...
A partition of a positive number n is a representation of this number as a sum of natural numbers, c...