On the necessary and sufficient condition of a k-Euler pair

Abstract

In this paper, we discuss George Andrews’ definition of an Euler pair andSubbarao’s generalization of the Euler pair to a k-Euler pair. Let N and M be non-empty sets of natural numbers. A pair (N, M) is called a k-Euler pair if, for any natural number n, the number of partitions of n into parts from N is equal to the number of partitions of n into parts  from M, with  the  condition  that  each  part  appears  fewer than k times. We further explore several theorems concerning Euler pairs that were established by Andrews and Subbarao, and we present proofs using a method distinct from those previously utilized