平面上有 2022 個相異格子點。令 為這些點中,有幾對點之間的距離恰為 1 的點對數量。求 的最大可能值。
註:格子點為 座標與 座標皆為整數的點。
平面上有 2022 個相異格子點。令 為這些點中,有幾對點之間的距離恰為 1 的點對數量。求 的最大可能值。
註:格子點為 座標與 座標皆為整數的點。
There are 2022 distinct lattice points on the plane. Let be the number of pairs of points among these points whose distance is exactly 1. Find the maximum possible value of .
Note: A lattice point is a point whose -coordinate and -coordinate are both integers.
The maximum possible is 3954; this maximum is achieved by a grid of points with three corners removed.
For any 2022 distinct lattice points, suppose that they have a total of distinct -coordinates , and there are points with -coordinate equal to . Note that among the points on the column , one can form at most segments of length 1 perpendicular to the -axis, so the total number of segments of length 1 perpendicular to the -axis .
Similarly, if these points have a total of distinct -coordinates, then the total number of segments of length 1 perpendicular to the -axis .
Moreover, since a segment of length 1 between lattice points must be perpendicular to one of the coordinate axes, we have
But also note that 2022 distinct points guarantee , so by AM-GM we have
Therefore .