加入
Heilbronn's triangle problem: record configurations
Place n points in a square or triangle so the smallest triangle they form is as large as possible; beat a record or prove one optimal.
+23 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,23 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "mathematics", | |
| 3 | + "topics": [ | |
| 4 | + "discrete-geometry" | |
| 5 | + ], | |
| 6 | + "type": "construction", | |
| 7 | + "also": [ | |
| 8 | + "proof" | |
| 9 | + ], | |
| 10 | + "cover": { | |
| 11 | + "motif": "points", | |
| 12 | + "n": 10 | |
| 13 | + }, | |
| 14 | + "source": { | |
| 15 | + "key": "heilbronn", | |
| 16 | + "name": "The Heilbronn Problem (record tables)", | |
| 17 | + "url": "https://math.tejstead.com/heilbronn/", | |
| 18 | + "curator": "Tej Stead", | |
| 19 | + "status": "open", | |
| 20 | + "as_of": "2026-10-20", | |
| 21 | + "catalog": "0521c19bbd38" | |
| 22 | + } | |
| 23 | +} | |