Analyzing the Setup
To find the number of integer-coordinate points (a,b) strictly inside the triangle formed by the origin (0,0), the X-intercept (20,0), and the Y-intercept (0,15), we must satisfy three primary constraints:
1. a>0
2. b>0
3. 3a+4b<60
We are further constrained by the condition that b is a multiple of a. We can express this as b=ka, where k is a positive integer.
The Master Equation
Substituting b=ka into the inequality 3a+4b<60, we obtain:
Since a must be a positive integer (a≥1), the number of possible values for a for a fixed k is given by the largest integer strictly less than 3+4k60.
Systematic Enumeration
We iterate through values of k to determine the number of valid integer values for a:
For k=1: a<760≈8.57⇒a∈{1,2,…,8} (8 points)
For k=2: a<1160≈5.45⇒a∈{1,2,3,4,5} (5 points)
For k=3: a<1560=4⇒a∈{1,2,3} (3 points)
For k=4: a<1960≈3.15⇒a∈{1,2,3} (3 points)
For k=5: a<2360≈2.60⇒a∈{1,2} (2 points)
For k=6: a<2760≈2.22⇒a∈{1,2} (2 points)
For k≥7, the upper bound 3+4k60 becomes less than 2. Specifically, for k∈{7,8,9,10,11,12,13,14}, the value of a must be 1.
For k=7 to k=14: There are 14−7+1=8 values of k. Each yields a=1 (8 points*).
If k=15, then a<6360<1, which yields no positive integer solutions for a.
Final Calculation
Summing the points obtained from each case:
The total number of integer-coordinate points satisfying the given conditions is 31.