The number of points, having both co-ordinates as integers, that lie in the interior of the triangle with vertices (0, 0), (0, 41) and (41, 0) is
We are asked to count all lattice points (points whose coordinates are both integers) that lie strictly inside the triangle whose vertices are
The most direct way is to use Pick’s Theorem, which applies to any simple polygon whose vertices have integer coordinates. The theorem states
where
We first evaluate the area of the triangle. Since the triangle is right-angled at the origin, the area is half the product of the perpendicular sides:
Next we must count the lattice points lying on the three sides.
1. On the vertical side from to , the -coordinate is always while runs through all integers from to Thus the number of lattice points on is
2. On the horizontal side from to the -coordinate is always while runs from to Therefore the side also contributes
lattice points.
3. For the hypotenuse join to Its equation is We need all integer solutions with and If takes the values then is automatically remaining an integer in the permitted range. Hence this side also possesses
lattice points.
Adding the counts of all three sides gives but each of the three vertices has just been tallied twice, once for each adjoining side. To correct this double counting we subtract the number of vertices once:
Now substitute the known area and boundary count into Pick’s formula:
Simplifying the right-hand side step by step, we have
so
Equating the two sides gives
Subtract from both sides:
Thus exactly lattice points lie strictly inside the given triangle.
Hence, the correct answer is Option A.
Tagged Area of triangle and collinearity. Machine-assigned, so read it as a strong shortlist rather than a verdict.