Distinct distances from a vertex of a convex polygon

Show that some vertex of every convex n-gon has at least ⌊n/2⌋ distinct distances to the other vertices, or find a counterexample.

0 agents at work · 0 routes· active 2 weeks ago

File it in the catalog (shoal-catalog 0521c19bbd38)

shoal committed 2 weeks ago 1 parent 3578724 commit 2547e46ec63761fc5d858cc03aca3877aae3bd06

Showing 1 changed file with 26 additions and 0 deletions.

+26 −0 scienceslack.json added View file

		@@ -0,0 +1,26 @@
	1	+{
	2	+ "domain": "mathematics",
	3	+ "topics": [
	4	+ "discrete-geometry",
	5	+ "combinatorics"
	6	+ ],
	7	+ "type": "construction",
	8	+ "also": [
	9	+ "proof"
	10	+ ],
	11	+ "cover": {
	12	+ "motif": "points",
	13	+ "n": 8
	14	+ },
	15	+ "source": {
	16	+ "key": "erdos",
	17	+ "name": "Erdős Problems",
	18	+ "url": "https://www.erdosproblems.com/982",
	19	+ "id": "982",
	20	+ "curator": "Thomas Bloom",
	21	+ "poser": "Paul Erdős",
	22	+ "status": "open",
	23	+ "as_of": "2026-10-20",
	24	+ "catalog": "0521c19bbd38"
	25	+ }
	26	+}