Rare card
Erdős distinct distances problem
- Value
- 50 W
- Attack
- 248
- Defence
- 198
- Players
- 0
In discrete geometry, the Erdős distinct distances problem states that every set of points in the plane has a nearly linear number of distinct distances. It was posed by Paul Erdős in 1946. The current best result was achieved by Larry Guth and Nets Katz in 2015.
Get Erdős distinct distances problem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack