Does there exist on the Cartesian plane a convex -gon with vertices at integer points, such that the lengths of all its sides are equal?
Proposed by Anton Trygub
Does there exist on the Cartesian plane a convex -gon with vertices at integer points, such that the lengths of all its sides are equal?
Proposed by Anton Trygub
To determine whether there exists a convex -gon with vertices at integer points and all sides of equal length, we need to analyze the possible values of the squared side length .
1. **Checkerboard Coloring Argument for Odd :**
- Suppose the common side length is , where is odd.
- Color the lattice points in a checkerboard pattern, where each point is either black or white, and adjacent points have different colors.
- In a convex -gon, each vertex must be connected to two other vertices, forming sides of the polygon.
- Since is odd, the distance between any two adjacent vertices (which is ) must connect points of different colors.
- However, since is odd, there would be an odd number of sides, implying an odd number of color changes. This is impossible because the polygon must return to its starting point, requiring an even number of color changes.
- Therefore, no such polygon exists if is odd.
2. **Row Coloring Argument for :**
- Suppose .
- Color the rows of the lattice alternately black and white.
- For any side of length , the squared distance must hold.
- Given , both and must be odd (since the sum of two squares is only if both squares are ).
- This implies that any side of the polygon connects points in different rows, hence different colors.
- Again, since is odd, there would be an odd number of color changes, which is impossible for a closed polygon.
- Therefore, no such polygon exists if .
3. **Scaling Argument for :**
- Suppose .
- Then both and must be even (since the sum of two squares is only if both squares are ).
- This means we can write and for some integers and .
- The side length can be scaled down by a factor of , resulting in a new polygon with side length .
- Repeating this process, we eventually reduce the problem to one of the previous cases (either becomes odd or ).
- Since we have already shown that no such polygon exists in those cases, it follows that no such polygon exists if either.
Since we have exhausted all possible cases for , we conclude that no convex -gon with vertices at integer points and all sides of equal length exists.