MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The recent paper On the Erdos distinct distance problem in the plane Authors: Larry Guth, Nets Hawk Katz prodded me to get a non-trivial example. Here is what I cannot find: an example of 12 distinct points in the plane with only 5 different distances between points. The regular 12-polygon has 6 different lengths but I cannot do better. implies that there is one>

share|cite|improve this question
up vote 13 down vote accepted

I wish I could get images to work, but here goes my poor explanation:

Take a regular hexagonal lattice with distance 1 between nearest neighbors, and choose a 15-point equilateral triangle in this lattice (15 is a triangular number). Remove the 3 verticies of the triangle. You'll be left with 12 points and 5 distinct distances.

edit: just checked the OEIS reference, and it's available on google books. The picture you want is on page 200 at

share|cite|improve this answer

If I may supplement Logan Maingi's apposite answer with a snapshot of the page to which he refers:

(I couldn't resist including the surrounding conjecture.)

share|cite|improve this answer
Thanks! I tried to no avail to embed the image, but I'm still rather bad with TeX and couldn't get it to work. – Logan Maingi Mar 14 '11 at 14:35

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.