Browse · harp
Printsmc
counting and probability senior
Problem
How many squares whose sides are parallel to the axes and whose vertices have coordinates that are integers lie entirely within the region bounded by the line , the line and the line
(A)
(B)
(C)
(D)
Solution
Revised by Kinglogic and RJ5303707 (red shows lattice points within the triangle) If we draw a picture showing the triangle, we see that it would be easier to count the squares vertically and not horizontally. The upper bound is squares , and the limit for the -value is squares. First we count the squares. In the rightmost column, there are squares with length because generates squares from to , and continuing on we have , , and for -values for , , and in the equation . So there are squares with length in the figure. For squares, each square takes up units left and units up. Squares can also overlap. For squares, the rightmost column stretches from to , so there are squares with length in a by box. Repeating the process, the next column stretches from to , so there are squares. Continuing and adding up in the end, there are squares with length in the figure. Squares with length in the rightmost column start at and end at , so there are such squares in the right column. As the left row starts at and ends at there are squares with length . As squares with length would not fit in the triangle, the answer is which is .
Final answer
D