![]() |
![]() |
| Home | People | Software | Theory | Background | UC Davis Math |
In lecture one, we introduced the concept of counting the number of lattice points that lie inside and on the boundary of a given circle of radius
. We also
mentioned that, counting the number of lattice points in curvy regions such as hyperbolas, is equivalent to determining whether a given integer
is prime or
not. Since, it is difficult to check the primality of a given number
, this implies that counting the number of lattice points
that lie within and on the boundary
of curvy regions, is as difficult as checking the primality of an integer number
. As a result, we can safely deduce that counting the number of lattice points
inside and on the boundary of curvy regions is a fairly complicated process. Suppose then we restrict ourselves to counting the number of lattice points of less curvy
regions such as lines for instance.
Lattice Points of lines
Suppose we have a line
Again a natural question arises, how many lattice points are on it? To study this question further we offer the following theorem:
If we look at figure one we will see that the line skips every integral point on the graph. Suppose somebody said that the line should cross through (1,1). Then we can easily disprove such claim by plainly substituting
Suppose now we wanted to show that a line contains no lattice points! the following theorem can help with this
Moreover, given a line
, where
is irrational and
is any real number, has on either side an infinite strip of lattice points lying close
to the respective line.
If we consider figure 7 you will notice that on either side there exists lattice points trapped inside the infinite strip. For instance, the lattice points (1,2), (2,3) are on the right side of the line and the points (1,3) and (2,4) exist on the left side of the line. In this manner we can find lattice points inside the parallel strip for the entire line.
end of lecture 2