1999 AMC 8 Problems/Problem 11

Problem

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]$

$\text{(A)}\ 20 \qquad \text{(B)}\ 21 \qquad \text{(C)}\ 22 \qquad \text{(D)}\ 24 \qquad \text{(E)}\ 30$

kooky

1999 AMC 8 (Problems • Answer Key • Resources)
Preceded by Problem 10	Followed by Problem 12
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
All AJHSME/AMC 8 Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.

Page

Toolbox

Search

1999 AMC 8 Problems/Problem 11

Problem

See Also