Analyzing the Setup
To find the number of integer coordinates (x,y) that satisfy the inequality 4x2+y2<52, we treat this as a problem of counting lattice points within an elliptical boundary.
Since
y2≥0, we can establish a bound for
x by observing that
4x2<52. Dividing by
4, we obtain the constraint:
x2<13
The integers x that satisfy this condition are x∈{0,±1,±2,±3}. This reduces our search to seven distinct vertical lines.
The Systematic Walkthrough
We now evaluate the range of y for each possible value of x by substituting into the inequality y2<52−4x2.
Case 1: x=0
The inequality becomes y2<52. The integers y satisfying this are {−7,−6,−5,−4,−3,−2,−1,0,1,2,3,4,5,6,7}.
There are 15 points on this line.
Case 2: x=±1
Substituting x=±1 gives 4(1)2+y2<52, which simplifies to y2<48. The valid integers for y are {−6,−5,−4,−3,−2,−1,0,1,2,3,4,5,6}.
Each line contains 13 points. For both x=1 and x=−1, we have 2×13= 26 points.
Case 3: x=±2
Substituting x=±2 gives 4(4)+y2<52, which simplifies to y2<36. Because the inequality is strict, y cannot be ±6. The valid integers are {−5,−4,−3,−2,−1,0,1,2,3,4,5}.
Each line contains 11 points. For both x=2 and x=−2, we have 2×11= 22 points.
Case 4: x=±3
Substituting x=±3 gives 4(9)+y2<52, which simplifies to y2<16. The valid integers are {−3,−2,−1,0,1,2,3}.
Each line contains 7 points. For both x=3 and x=−3, we have 2×7= 14 points.
Final Calculation
To find the total number of lattice points, we sum the counts from all cases:
Total=15+26+22+14
Performing the addition:
15+26+22+14=77
There are exactly 77 integer pairs (x,y) that satisfy the given inequality.