1988 AJHSME Problems/Problem 16
Revision as of 22:55, 4 July 2013 by Nathan wailes (talk | contribs)
Problem
Placing no more than one in each small square, what is the greatest number of 's that can be put on the grid shown without getting three 's in a row vertically, horizontally, or diagonally?
Solution
By the Pigeonhole Principle, if there are at least 's, then there will be some row with 's. We can put in by leaving out the three boxes in one of the main diagonals.
See Also
1988 AJHSME (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 | ||
All AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.