Maths Olympiad Prep

Library / /482 of 520

Geometry Difficulty 7.2 National olympiad, round 2 Prove it

Example 3 On the coordinate plane, if the coordinates x0,y0x_{0}, y_{0} of a point (x0,y0)\left(x_{0}, y_{0}\right) are both integers, then the point is called an integer point. Try to prove: on the coordinate plane, there does not exist a regular nn-gon (n7)(n \geqslant 7), such that all its vertices are integer points.

Solution

Proof Assume there exists a regular nn-sided polygon A1A2A3An(n7)A_{1} A_{2} A_{3} \cdots A_{n}(n \geqslant 7), whose vertices A1,A2,,AnA_{1}, A_{2}, \cdots, A_{n} are all integer points.

Take any integer point MM in the coordinate plane, and draw vectors MB1,MB2,MB3,,MBn\overrightarrow{M B_{1}}, \overrightarrow{M B_{2}}, \overrightarrow{M B_{3}}, \cdots, \overrightarrow{M B_{n}} such that MB1=A1A2,MB2=A2A3,MB3=A3A4,,MBn1=An1An,MBn=AnA1\overrightarrow{M B_{1}}=\overrightarrow{A_{1} \vec{A}_{2}}, \overrightarrow{M B_{2}}=\overrightarrow{A_{2} A_{3}}, \overrightarrow{M B_{3}}=\overrightarrow{A_{3} A_{4}}, \cdots, \overrightarrow{M B_{n-1}}=\overrightarrow{A_{n-1} A_{n}}, \overrightarrow{M B_{n}}=\overrightarrow{A_{n} \overrightarrow{A_{1}}} (as shown in Figure 6-1).

Since A1,A2,,An,MA_{1}, A_{2}, \cdots, A_{n}, M are all integer points, by vector coordinate operations, it can be known that B1,B2,,BnB_{1}, B_{2}, \cdots, B_{n} are all integer points.

It is also easy to see that MBi=MBi+1(i=1,2,,n\left|\overrightarrow{M B_{i}}\right|=\left|\overrightarrow{M B_{i+1}}\right|\left(i=1,2, \cdots, n\right., define Bn+1=B1)\left.B_{n+1}=B_{1}\right), and the angle between MBi\overrightarrow{M B_{i}} and MBi+1\overrightarrow{M B_{i+1}} is 2πn\frac{2 \pi}{n}.

Therefore, the nn-sided polygon B1B2BnB_{1} B_{2} \cdots B_{n} is a regular nn-sided polygon.
It is easy to see that the nn-sided polygon B1B2BnB_{1} B_{2} \cdots B_{n} is similar to the nn-sided polygon A1A2AnA_{1} A_{2} \cdots A_{n}, with the similarity ratio being B1B2A1A2=B1B2MB1\frac{\left|B_{1} B_{2}\right|}{\left|A_{1} A_{2}\right|}=\frac{\left|B_{1} B_{2}\right|}{\left|M B_{1}\right|}, and since B1MB2=2πn\angle B_{1} M B_{2}=\frac{2 \pi}{n}, then B1B2MB1=2cosπn\frac{\left|B_{1} B_{2}\right|}{\left|M B_{1}\right|}=2 \cos \frac{\pi}{n}.

So B1B2=2cosπnA1A22cosπ7A1A2B_{1} B_{2}=2 \cos \frac{\pi}{n} \cdot\left|A_{1} A_{2}\right| \leqslant 2 \cos \frac{\pi}{7}\left|A_{1} A_{2}\right|.
This process can be repeated indefinitely, i.e., from the original regular nn-sided polygon, a series of regular nn-sided polygons can be obtained, each with a side length no greater than the previous regular nn-sided polygon's side length multiplied by 2cosπ72 \cos \frac{\pi}{7}, i.e., for any mN+m \in \mathbf{N}_{+}, there exists a convex nn-sided polygon with all vertices being integer points, whose side length is no greater than (2cosπ7)mA1A2\left(2 \cos \frac{\pi}{7}\right)^{m} \cdot\left|A_{1} A_{2}\right|, but 2cosπ7<12 \cos \frac{\pi}{7}<1, so when m+m \rightarrow +\infty, (2cosπ7)mA1A20\left(2 \cos \frac{\pi}{7}\right)^{m} \cdot\left|A_{1} A_{2}\right| \rightarrow 0, while the distance between any two different integer points is at least 1, i.e., the side length of the regular nn-sided polygon is no less than 1, leading to a contradiction.

Therefore, there does not exist a regular nn-sided polygon (n7)(n \geqslant 7) whose vertices are all integer points.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.