• Communications of the Korean Mathematical Society
• /
• v.17 no.3
• /
• pp.431-437
• /
• 2002

Representing a positive integer in terms of a sum of smaller numbers with certain conditions has been studied since MacMahon [5] pioneered perfect partitions. The complete partitions is in this category and studied by the second author[6]. In this paper, we study complete partitions with more specified completeness, which we call the double-complete partitions.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1279-1287
• /
• 2022

A partition of n is complete if every positive integer from 1 to n can be represented by the sum of its parts. The concept of complete partitions has been extended in several ways. In this paper, we consider the number of k-relaxed r-complete partitions of n and the number of double-complete partitions of n.