Join
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.
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault