In the Cartesian plane, let A=(0,0),B=(200,100), and C=(30,330). Compute the number of ordered pairs (x,y) of integers so that (x+21,y+21) is in the interior of triangle ABC.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
We use Pick's Theorem, which states that in a lattice polygon with I lattice points in its interior and B lattice points on its boundary, the area is I+B/2−1. Also, call a point center if it is of the form (x+21,y+21) for integers x and y. The key observation is the following - suppose we draw in the center points, rotate 45∘ degrees about the origin and scale up by 2. Then, the area of the triangle goes to 2K, and the set of old lattice points and center points becomes a lattice. Hence, we can also apply Pick's theorem to this new lattice. Let the area of the original triangle be K, let I1 and B1 be the number of interior lattice points and boundary lattice points, respectively. Let Ic and Bc be the number of interior and boundary points that are center points in the original triangle. Finally, let I2 and B2 be the number of interior and boundary points that are either lattice points or center points in the new triangle. By Pick's Theorem on both lattices, K2K⟹(I2−I1)⟹Ic=I1+B1/2−1=I2+B2/2−1=K−2B1−B2=K−2Bc One can compute that the area is 31500. The number of center points that lie on on AB,BC, and CA are 0,10, and 30, respectively. Thus, the final answer is 31500−20+10+30=31480.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.