Erdos Distinct Distances Problem Calculator

Erdos distinct distances problem was initially coined by Paul Erdos in 1946 and later proved by Guth & Katz recently. This problem belongs to discrete geometry. It states that between 'n' distinct points on a plane there are at least 'n1 - o(1)' distinct distances. Enter the number of points in the plane and find its Erdos Distinct Distance using this calculator.

Erdos Number Calculator

Erdos distinct distances problem was initially coined by Paul Erdos in 1946 and later proved by Guth & Katz recently. This problem belongs to discrete geometry. It states that between 'n' distinct points on a plane there are at least 'n1 - o(1)' distinct distances. Enter the number of points in the plane and find its Erdos Distinct Distance using this calculator.

Code to add this calci to your website Expand embed code Minimize embed code

Formula:

d=n/√(log(n)) Where, d = Erdos Distinct Distance n = Number of Points in the Plane

Example

There are 5 points in a plane and hence
Erdos Distinct Distance = 5 / √(log(5))
= 5.9805.


english Calculators and Converters


Sitemap