One hundred points labeled 1 to 100 are arranged in a grid such that adjacent points are one unit apart. The labels are increasing left to right, top to bottom (so the first row has labels 1 to 10 , the second row has labels 11 to 20, and so on). Convex polygon has the property that every point with a label divisible by 7 is either on the boundary or in the interior of . Compute the smallest possible area of .
Solution
The vertices of the smallest are located at the points on the grid corresponding to the numbers , and 70 . The entire grid has area 81 , and the portion of the grid not in is composed of three triangles of areas . Thus the area of is .
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.