Least Changes to Make Sums Different
Source: Germany TST 2012 P1
April 13, 2020
combinatorics
Problem Statement
Find the least integer such that for any table filled with integers Kain chooses, Abel be able to change at most cells to achieve a new table in which sums of rows and columns are pairwise different.