Question
A triangle is formed by X-axis, Y-axis and the line . Then the number of points P(a, b) which lie strictly inside the triangle, where a is an integer and b is a multiple of a, is ____________.
Answer: 1
Solution
Key Concepts and Formulas
- The equation of a line defines a region in the Cartesian plane. Points strictly inside the triangle formed by the axes and the line satisfy , , and .
- Integer solutions can be found by systematically checking integer values for one variable and solving for the other.
- The number of multiples of 'a' less than a given number 'y' can be found by , where is the floor function representing the greatest integer less than or equal to x.
Step-by-Step Solution
Step 1: Define the region of interest. The triangle is formed by the x-axis (), the y-axis (), and the line . Since we are looking for points strictly inside the triangle, we need , , and .
Step 2: Express in terms of . We can rewrite the inequality as , which gives us .
Step 3: Determine the possible integer values of . Since and , we must have , which implies , so , and . Therefore, can take integer values from 1 to 19.
Step 4: Iterate through possible values of and count the valid points. We are given that , where is an integer. Since , we need to count the number of multiples of , where is the x-coordinate, that are strictly less than . In our case, . So, we need to find the number of integer multiples of that are less than . Thus, we want to find the number of integers such that . This is equivalent to . The number of such integers is .
Let's analyze this for :
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , can be . The number of such points is .
-
If , then . Since is a multiple of , we have . Since , no solutions exist.
-
If , then . Since is a multiple of , we have . Since , no solutions exist.
We can observe that for , , so there are no solutions.
Step 5: Calculate the total number of points. The total number of points is .
Common Mistakes & Tips
- Be careful when calculating the upper bound for . Ensure you are using the strict inequality.
- Remember that and must be strictly positive.
- Don't forget to use the floor function to find the number of integers.
Summary
We found the region defined by the triangle and the condition that the points must lie strictly inside. We then iterated through possible integer values of and calculated the number of multiples of that lie within the allowed range for . Finally, we summed the number of points for each value to find the total number of such points.
The final answer is .