Disjoint odd integer subsets having a constant odd sum
\textit{K. Ando}, \textit{S. Gervacio} and \textit{M. Kano} [Discrete Math. 82, No. 1, 7-11 (1990; Zbl 0732.05002)] characterized for positive integers \(n\), \(m\), \(k\), systems of \(k\) disjoint nonempty subsets of \(\{1,2, \dots, n\}\) having constant sum \(m\). They also conjectured a characterization of a similar result for \(k\) disjoint nonempty subsets of \(\{1,3,5, \dots, 2n-1\}\). This conjecture was in two parts, according as \(m\) is even or odd. Ando, Gervacio, and Kano announced the even case of their conjecture had been proved by H. Enomoto and M. Kano. The present paper contains a proof of the conjecture when \(m\) is odd.
- Disjoint odd integer subsets having a constant even sum
- Disjoint subsets of integers having a constant sum
- Integer sets with distinct subset sums
- Disjoint sets of distinct sum sets
- Integer Sets with Distinct Subset-Sums
- Disjoint Pairs with Distinct Sums
- A construction for sets of integers with distinct subset sums
- scientific article; zbMATH DE number 7177936
- Partitions of a positive integer as the sum of continuous even or odd numbers
- Disjoint odd integer subsets having a constant even sum
- Centrally symmetric and magic rectangles
- Constant sum partition of sets of integers and distance magic graphs
- Problems on integer decomposition
- NUMBER OF SUBSETS OF THE SET [n] INCLUDING NO TWO CONSECUTIVE ODD INTEGERS
- A note on graph burning of path forests
- Disjoint subsets of integers having a constant sum
This page was built for publication: Disjoint odd integer subsets having a constant odd sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322179)
