Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Shopping at the store helps maintain the site. Thank you.
Learning Math Online
Sites for teachers
Sites for parents
Terms of use
Awards
Interactive Activities

CTK Exchange
CTK Wiki Math
CTK Insights - a blog
Math Help

III Millennium Olympiad

Games & Puzzles
What Is What
Arithmetic
Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Stories for Young
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Sites for parents

Education & Parenting

Manifesto  |  Bookstore  |  Contents  |  Amazon store  |  Term index  |  What changed?  |  Contact  |  Recommend
RSS Feed: Recent changes at CTK

Five Lattice Points: What is that about?
A Mathematical Droodle

The blue dots below are draggable.


This applet requires Sun's Java VM 2 which your browser may perceive as a popup. Which it is not. If you want to see the applet work, visit Sun's website at http://www.java.com/en/download/index.jsp, download and install Java VM and enjoy the applet.


Buy this applet
What if applet does not run?

Discussion

Copyright © 1996-2010 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Discussion

If five nodes of a plane lattice are chosen at random, some two of them define a line that contains other lattice points, and more specifically, the midpoint of the segment between the two points is necessarily a lattice point. Four points may not possess such a pair. The applet above illustrates this statement in case of the square grid.

The validity of the statement for four points is easily established with the help of the applet. The case of five points is also simple.

The midpoint of the segment joining points P(x1, y1) and Q(x2, y2) is given by M((x1 + x2)/2, (y1 + y2)/2). M is the lattice point if and only if x1 and x2 are of the same parity and so are y1 and y2. With 2 coordinates, there are four different parity pairs: odd/odd, odd/even, even/odd and even/even. Among five points, at least two are bound to have the same parity combination. The line joining any two such points is bound to contain other lattice nodes.

The proof makes use of the Pigeonhole Principle: If n objects are distributed between fewer than n boxes, at least one box must contain at least two of the objects.

References

  1. M. Aigner, G. Ziegler, Proofs from THE BOOK, Springer, 2000
  2. B. Averbach, O. Chein, Problem Solving Through Recreatinoal Mathematics, Dover, 2000
  3. M. Gardner, The Last Recreation, Copernicus, 1997
  4. R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics, 2nd edition, Addison-Wesley, 1994.

Copyright © 1996-2010 Alexander Bogomolny

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

35698727Page copy protected against web site content infringement by Copyscape

Search:
Keywords:

Google
Web CTK