The equal-sum partition conjecture for cyclic groups of order 2^n
Statement
Let be a cyclic group of order . Let and be positive integers satisfying
with and for . Equal-sum partition conjecture. There exists such that the nonzero elements of can be partitioned into disjoint subsets with and
for every , . This is presented as an equivalent formulation of the complete multipartite distance-magic conjecture, whose status is not separately resolved in the source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.