Equisum Partitions of Sets of Positive Integers
Let V be a finite set of positive integers with sum equal to a multiple of the integer b. When does V have a partition into b parts so that all parts have equal sums? We develop algorithmic constructions which yield positive, albeit incomplete, answers for the following classes of set V, where n is a given positive integer: (1) an initial interval a∈Z+:a≤n; (2) an initial interval of primes p∈P:p≤n, where P is the set of primes; (3) a divisor set d∈Z+:d|n; (4) an aliquot set d∈Z+:d|n, d<n. Open general questions and conjectures are included for each of these classes.
2012 ◽
Vol 93
(1-2)
◽
pp. 85-90
◽
Keyword(s):
2006 ◽
Vol 02
(03)
◽
pp. 455-468
◽
Keyword(s):
2015 ◽
Vol 07
(01)
◽
pp. 1550001
1991 ◽
Vol 14
(3)
◽
pp. 457-462
◽
Keyword(s):
1961 ◽
Vol 5
(1)
◽
pp. 35-40
◽
2018 ◽
Vol 11
(04)
◽
pp. 1850056
◽
Keyword(s):
2021 ◽
Vol 14
(2)
◽
pp. 380-395