# Difference between revisions of "1993 AJHSME Problems/Problem 25"

## Problem

A checkerboard consists of one-inch squares. A square card, $1.5$ inches on a side, is placed on the board so that it covers part or all of the area of each of $n$ squares. The maximum possible value of $n$ is

$\text{(A)}\ 4\text{ or }5 \qquad \text{(B)}\ 6\text{ or }7\qquad \text{(C)}\ 8\text{ or }9 \qquad \text{(D)}\ 10\text{ or }11 \qquad \text{(E)}\ 12\text{ or more}$

## See Also

 1993 AJHSME (Problems • Answer Key • Resources) Preceded byProblem 24 Followed byLast Problem 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
Invalid username
Login to AoPS