Rational Distance Problem

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Is there a point at rational distances from the vertices of a unit square? This unsolved question is known as the rational distance problem [1, 2].

[more]

This Demonstration gives 2877 canonical triples, which are points at rational distances from the vertices , , and . These triples were collected by analyzing primitive Heronian triangles [3] (triangles with rational sides and areas). If is a triple, so are and the inverse , so each triple gives three others.

A triple has rational coordinates. Consider the squares of the distances: , , and All of these need to be rational, so the differences and are also rational.

[less]

Contributed by: Ed Pegg Jr (June 2016)
Open content licensed under CC BY-NC-SA


Snapshots


Details

The ellipse has 193 of the triples (or 386 counting reflections in ), with inverse points on the cubic .

References

[1] R. K. Guy, "Rational Distances from the Corner of a Square," in Unsolved Problems in Number Theory, 2nd ed., New York: Springer-Verlag, 1994 pp. 181–185.

[2] Wikipedia. "Unit Square." (May 26, 2016) en.wikipedia.org/wiki/Unit_square.

[3] S. Kurz. "Heronian Figures." (May 26, 2016) www.wm-archive.uni-bayreuth.de/index.php?id=554&L=3.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send