# 1997 AHSME Problems/Problem 16

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Problem

The three row sums and the three column sums of the array $$\left[\begin{matrix}4 & 9 & 2\\ 8 & 1 & 6\\ 3 & 5 & 7\end{matrix}\right]$$

are the same. What is the least number of entries that must be altered to make all six sums different from one another? $\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$

## Solution

If you change $3$ numbers, then you either change one number in each column and row (ie sudoku-style): $$\left[\begin{matrix}* & 9 & 2\\ 8 & * & 6\\ 3 & 5 & *\end{matrix}\right]$$

Or you leave at least one row and one column unchanged: $$\left[\begin{matrix}* & 9 & 2\\ * & * & 6\\ 3 & 5 & 7\end{matrix}\right]$$

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 $x$ is the same as in column $x$.)

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 $3$ and column $3$ are untouched.)

Either way, $3$ 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: $$\left[\begin{matrix}* & 9 & 2\\ * & * & 6\\ 3 & * & 7\end{matrix}\right]$$

Letting the $*$ be a zero does indeed give $6$ different sums, so the answer is $4$, which is option $\boxed{D}$.

## See also

 1997 AHSME (Problems • Answer Key • Resources) Preceded byProblem 15 Followed byProblem 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. Invalid username
Login to AoPS