Let E={−1,0,1} and let M be a set of lattice points of the plane. The points of M are connected to one another by a network of segments (S) in such a way that one can get from every point of M to every other point of M without leaving (S). Here, besides the lattice points, the segments of the network may also have other endpoints. Determine the shortest total length of the network of segments, if:
a) M={(i,j)∣i,j∈E and i⋅j=0}
b) M={(i,j)∣i,j∈E}
Solution
Solution:
Part a): For reasons of symmetry, it suffices first to find the most favorable network of segments for the points O(0,0), A(1,0) and C(0,1). By reflection through O one then obtains the desired network for the points of M. By a rotation of the plane xOy about O through an angle of 60∘ (Fig. 1), the triangle △OAC is carried into the triangle △OA′C′, where the segment P′C′ is the image of PC. The shortest system of segments connecting the points O, A and C as required therefore has a total length equal to that of the segment AC′.
Fig. 1
In the triangle △OAC′, however, AC′=2−2cos150∘=2+3 (law of cosines). By reflection through the origin O one obtains, for part a), a shortest system of segments with total length 22+3=2+6.
Part b): Likewise, for reasons of symmetry, it suffices first to find the shortest system of segments for the points D(−1,1), O(0,0), A(1,0), B(1,1) and C(0,1). Since the distance from D to the remaining four points is at least 1, such a system has a total length of 1+22+6=1+1+3=2+3 (see Fig. 2).
Fig. 2
Thus (after reflection through O) one obtains for b) a total length of 2(2+3)=4+23.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement translated into English from de; metadata (topic, difficulty) added by this project.