Let and have coordinates and respectively. Let and be the angles from the positive
-axis to the lines and respectively, measured in the
clockwise direction. For example, if has coordinates and has coordinates , and .
Assume towards a contradiction, that , and are integers and is .
Case 1: and .
Since , then or . Therefore, . We have and . By the angle
sum formula for tan,
Since , and are integers with and , is rational.
However, is well known to
be irrational, which gives us a contradiction. We can now conclude that
if and are lattice points, then is not .
Case 2:
or .
In this case, at least one of
or is on the -axis. Note that if is on the -axis, then cannot be on the - or - axis (since is not , , or ). Similarly, if is on the -axis, then cannot be on the - or -axis. So actually, exactly one of or is on the -axis, and the other is not on the -axis.
Let and be the result of rotating and clockwise about the origin. Now
exactly one of and are on the -axis, and the other is not on the -axis. Furthermore, . We are
now back in Case 1 above but with the points and , and can conclude cannot be .
Case 1: and .
Question 1 tells us that there are no equilateral lattice triangles.
In fact, we can also rule out the existence of a regular lattice -gon where is a multiple of three. To see this,
label the vertices in a clockwise order.
Then . Therefore, all three of , and cannot be lattice points.
Case 2: .
Next we will show that there are no regular lattice pentagons. We
will approach this by showing that if there is a regular lattice
pentagon, then we can create a smaller regular lattice pentagon. Then we
can do it again, and create an even smaller regular lattice pentagon. We
can continue to create smaller and smaller lattice pentagons, until we
have a lattice pentagon with side length less than , so it cannot be a lattice pentagon!
The only way to resolve this contradiction is to conclude that the
original pentagon does not exist! Let’s execute this plan.
Consider a regular pentagon . Create a smaller regular
pentagon by drawing all five diagonals of the pentagon, and taking the
five intersections to be the vertices of our smaller pentagon (see the
diagram below).
More precisely,
the lines and intersect at ,
the lines and intersect at ,
the lines and intersect at ,
the lines and intersect at , and
the lines and intersect at .
Then is a
regular pentagon (see if you can prove this!). Suppose the side length
of pentagon is
, and the side length of is . The goal now is to write down an
expression for in terms of
. By the solution to Question
, . Since the interior angle of a regular pentagon is
, we have .
Let be a point on so that is perpendicular to . Let be the point on so that is perpendicular to . Then and are the midpoints of and respectively (this fact needs
proof, but I will leave it up to you!).
There are now two right-angled triangles, and . Consider the former
triangle. Note that the length of is and . Let be the length of . Then Now
consider right-angled triangle . We have , and the length of is . Therefore, Solving for in both of these equations and
rearranging gives At the end of this
solution, there is an extra section which shows how to deduce that
and . Using these exact values we have Note that and so .
Great, we can now repeat this process of creating smaller and smaller
pentagons, and we can compute the side length of each one as
follows.
Let be a positive integer, and
suppose is a
regular pentagon with side length . Create the pentagon as
above by declaring that
the lines and intersect at ,
the lines and intersect at ,
the lines and intersect at ,
the lines and intersect at , and
the lines and intersect at .
Then is a
regular pentagon with side length where
Repeatedly applying the equation we have that for any positive integer
, We will now
prove that there is some large
enough so that . Choose a
positive integer so that Here we don’t care what the base is for the logs,
so we will be lazy and not write anything down as the base. After
rearranging the inequality a little, and applying some log laws we have
Since , . Therefore, Great!
Let’s put everything together. Suppose is a regular lattice
pentagon with length . Then by
Question 2(b), the regular pentagon is a lattice pentagon for
all positive integers . However,
when we have shown that the side length of satisfies . Since the smallest distance
between two lattice points in the plane is , cannot be a lattice
pentagon, which is a contradiction! Therefore, a regular pentagon cannot
be a lattice pentagon.
Case 3: .
The general strategy for this case will be the same as in the case
. The difference here will be
our construction of successive smaller regular polygons.
Let be a regular -gon with side length . Let be the regular -gon obtained from by applying times the process from Question 3. Let
have side length . Then from the solution to 3(b) above
we have Between and , the sine function is strictly
increasing. Therefore, for
we have As in the case, we want to show that if we
choose to be big enough, . To that end, let and choose a positive
integer so that
Then again, since ,
and we have It remains
to show that if is a lattice
polygon, then so is . Let
be the lattice polygon , where has coordinates . Now, translate the polygon
so that its center is at
the origin , with coordinates
. Let be the polygon . Then for each , has coordinates , and has coordinates . Since each of the
and are integers, we have that each of
the is a lattice point and
is a lattice polygon.
Great, now we can put everything together. Suppose is a regular lattice -gon with side length . Then for each positive integer , we can create another regular lattice
-gon with side length , where . If , then
, contradicting the fact
that is a lattice polygon.
Therefore, we can conclude that for , there is no regular lattice -gon.
Through the cases we have ruled out the existence of a regular
lattice -gon for all except for . Of course, there are plenty of
lattice squares!