Problem
1999 AMC 8 Problem 11
Each of the five numbers 1, 4, 7, 10, and 13 is placed in one of the five squares so that the sum of the three numbers in the horizontal row equals the sum of the three numbers in the vertical column. The largest possible value for the horizontal or vertical sum is
![[asy] draw((0,0)--(3,0)--(3,1)--(0,1)--cycle); draw((1,-1)--(2,-1)--(2,2)--(1,2)--cycle); [/asy]](/static/aops/5a63267c9764e69c4a9d9a68d30bd7e85138a60a.png)
\text{(A)}\ 20 \qquad \text{(B)}\ 21 \qquad \text{(C)}\ 22 \qquad \text{(D)}\ 24 \qquad \text{(E)}\ 30
Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.
Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)
Problem feedback
Difficulty
—