Partition Problems and a Pattern of Vertical Sums
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. Based on a pattern of sums of certain elements in the three sets, we find a more standard solution to the problem, using only congruence modulo five. We also show that the original statement plays a special role among all statements that satisfy the same pattern of the sums.
Copyright (c) 2018 Eunice Krinsky, Serban Raianu, Alexander Wittmond
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.