1997 AHSME Problems/Problem 16
Problem
The three row sums and the three column sums of the array
are the same. What is the least number of entries that must be altered to make all six sums different from one another?
Solution
If you change numbers, then you either change one number in each column and row (ie sudoku-style):
Or you leave at least one row and one column unchanged:
In the first case, you are changing just one common number in two sums, so you wind up with three pairs of sums. (In the example given, the sum in row is the same as in column .)
In the second case, since two of the sums are unchanged, and the sums started out equal, they must remain equal. (In the second example given, row and column are untouched.)
Either way, changes is not enough. However, building on the second example, if you change either the untouched column or the untouched row, you will get a possible answer:
Letting the be a zero does indeed give different sums, so the answer is , which is option .
See also
1997 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 15 |
Followed by Problem 17 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.