- Erdős–Anning theorem
The Erdős–Anning theorem states that an
infinite number of points in the plane can have mutualinteger distances only if all the points lie on astraight line . It is named afterPaul Erdős andNorman H. Anning , who proved it in 1945.An alternative way of stating the theorem is that a non-collinear set of points in the plane with integer distances can only be extended by adding finitely many additional points, before no more points can be added. A set of points to which no more can be added, with all points on the integer grid, forms an
Erdős-Diophantine graph .Proof
Let "A", "B" and "C" be non-
collinear points with mutual distances "D(AB)", "D(BC)" and "D(AC)" not exceeding "d", and "X" a point at integer distance from "A", "B" and "C". From thetriangle inequality it follows that "|D(AX) - D(BX)|" is a non-negative integer not exceeding "d". So "X" is on one of the "d+1"hyperbola s through "A" and "B". Similarly, "X" is situated on one of the "d+1" hyperbolas through "B" and "C". As two distinct hyperbolas can not intersect in more than four points, there are at most "4(d+1)2" points X.References
*citation
first1 = Norman H.
last1 = Anning
first2 = Paul
last2 = Erdős
authorlink2 = Paul Erdős
title = Integral distances
journal =Bulletin of the American Mathematical Society
volume = 51
pages = 598–600
year = 1945
url = http://www.ams.org/bull/1945-51-08/S0002-9904-1945-08407-9/External links
*mathworld | urlname = Erdos-AnningTheorem | title = Erdos-Anning Theorem
Wikimedia Foundation. 2010.