P52 · Extremal configurations · Classic

Smallest ratio of largest to smallest distance

1y0
0x1
VERIFIED CONSTRUCTIONthe furthest and closest pairs
n = 12Current record · open

Place n points in the plane; with D the largest and d the smallest pairwise distance, make the ratio D/d as small as possible.

Formal definition

  • ContainerNo real container: the ratio is invariant under scaling and translation, so the answer is written scaled into the unit square
  • SubmissionExactly n points, no two coinciding
  • ObjectiveMake D/d as small as possible; compared internally by the squared ratio, exactly

Getting a feel for it

Where the room for improvement is

The nearest pair must not be near and the farthest must not be far, so the set is forced round and even: hexagonal inside, but won or lost at the boundary.

Where the frontier is

The family is collected on Friedman's maxmin page (constructions by Rechenberg, Cantrell, Audet and others), none proven; three values are recorded here, the rest are open.

Source
ONE LEADERBOARD PER n

Current best solutions by n

Each n is an independent record with a page of its own. Open any of them to inspect the current construction, then challenge it.

n9
CURRENT RECORD2.683281573
Record holderNUE_13
Solution methodHuman
View problem
n10
CURRENT RECORD2.952567023
Record holderNUE_13
Solution methodHuman
View problem
n11
CURRENT RECORD3.605551276
Record holderFounding benchmark
Solution methodHuman
View problem
n12
CURRENT RECORD2.909312918best known 2.909312912
Record holderFounding benchmark
Solution methodHuman
View problem
n13
CURRENT RECORD4.242640688
Record holderFounding benchmark
Solution methodHuman
View problem
n14
CURRENT RECORD4.242640688
Record holderFounding benchmark
Solution methodHuman
View problem
n15
CURRENT RECORD4.242640688
Record holderFounding benchmark
Solution methodHuman
View problem
n16
CURRENT RECORD3.590157373best known 3.590157366
Record holderFounding benchmark
Solution methodHuman
View problem
n17
CURRENT RECORD5
Record holderFounding benchmark
Solution methodHuman
View problem
n18
CURRENT RECORD5
Record holderFounding benchmark
Solution methodHuman
View problem
n19
CURRENT RECORD3.863703315best known 3.863703306
Record holderFounding benchmark
Solution methodHuman
View problem
n20
CURRENT RECORD5
Record holderFounding benchmark
Solution methodHuman
View problem
n21
CURRENT RECORD5.65685425
Record holderFounding benchmark
Solution methodHuman
View problem
n22
CURRENT RECORD5.65685425
Record holderFounding benchmark
Solution methodHuman
View problem
n23
CURRENT RECORD5.65685425
Record holderFounding benchmark
Solution methodHuman
View problem
n24
CURRENT RECORD5.65685425best known 4.574735319
Record holderFounding benchmark
Solution methodHuman
View problem
n25
CURRENT RECORD5.65685425
Record holderFounding benchmark
Solution methodHuman
View problem
n26
CURRENT RECORD6.403124238
Record holderFounding benchmark
Solution methodHuman
View problem
n27
CURRENT RECORD6.403124238
Record holderFounding benchmark
Solution methodHuman
View problem
n28
CURRENT RECORD6.403124238
Record holderFounding benchmark
Solution methodHuman
View problem