Question
The number of points, having both co-ordinates as integers, that lie in the interior of the triangle with vertices and is :
Options
Solution
Key Concepts and Formulas
- Lattice Points: Points with integer coordinates are called lattice points or integral points.
- Inequalities for Regions: The interior of a region bounded by lines can be described using strict inequalities ( or ).
- Sum of First n Natural Numbers: The sum of the first natural numbers is given by the formula:
Step-by-Step Solution
Step 1: Define the Triangle and its Boundaries
We are given a triangle with vertices at , , and . We need to find the number of lattice points in the interior of this triangle. The sides of the triangle are defined by the following lines:
- (y-axis)
- (x-axis)
- (line connecting and )
Step 2: Define the Inequalities for the Interior of the Triangle
For a point to lie in the interior of the triangle, it must satisfy the following strict inequalities:
- (to the right of the y-axis)
- (above the x-axis)
- (below the line )
Since we are looking for integer coordinates, and must be integers.
Step 3: Determine the Range of Possible x Values
Since must be a positive integer, the smallest possible value for is . We also have the constraint . Since , the smallest possible integer value for is . Therefore, , which means . Since x must be an integer, . Thus, the possible integer values for are .
Step 4: Determine the Range of Possible y Values for Each x
For each value of , we need to find the possible integer values of that satisfy the inequalities. We know and , which means . Combining these, we have . Since y must be an integer, we have .
Step 5: Count the Number of Possible y Values for Each x
For each integer value of from to , the number of possible integer values for is .
- If , then , so there are possible values for .
- If , then , so there are possible values for .
- If , then , so there are possible values for .
- ...
- If , then , so there is possible value for .
Step 6: Calculate the Total Number of Lattice Points
The total number of lattice points in the interior of the triangle is the sum of the number of possible values for each :
This is the sum of the first 39 natural numbers, which can be calculated using the formula:
Common Mistakes & Tips
- Strict vs. Non-Strict Inequalities: Be careful to use strict inequalities ( or ) for "interior" points and non-strict inequalities ( or ) for points "on or within" the region.
- Counting Integers in a Range: When counting the number of integers in a range , remember to include both endpoints by using the formula .
- Formula Application: Recognize common patterns like the sum of the first natural numbers to simplify calculations.
Summary
We found the number of lattice points in the interior of the triangle with vertices , , and by defining the region using inequalities, iterating through possible integer values for , and calculating the range of possible integer values for for each . Finally, we summed the number of values for each to find the total number of lattice points, which is 780.
Final Answer
The final answer is \boxed{780}, which corresponds to option (B).