"""Exact small controls for logical strength; no Theodorus sums are rerun.""" from fractions import Fraction import json indices = [10000, 1000000, 100000000] residuals = [Fraction(1, 100), Fraction(1, 1000), Fraction(1, 10000)] assert all(abs(b) < abs(a) for a, b in zip(residuals, residuals[1:])) assert [n*r for n, r in zip(indices, residuals)] == [100, 1000, 10000] lo, hi = Fraction(-2160, 1000), Fraction(-2156, 1000) midpoint = (lo+hi)/2 possible_limit = Fraction(-21575, 10000) assert lo < midpoint < hi and hi-lo < Fraction(5, 1000) assert lo < possible_limit < hi assert abs(midpoint-possible_limit) == Fraction(1, 2000) assert Fraction(1, 3)+Fraction(1, 4) == Fraction(7, 12) assert 2*Fraction(7, 12) == Fraction(7, 6) bounds = {n: str(1-Fraction(2, n+1)) for n in (1000000, 10000000)} assert all(Fraction(value) > Fraction(99999, 100000) for value in bounds.values()) print(json.dumps({ "decreasing_residual_predicate_accepts_n_minus_half": True, "n_times_synthetic_residual": [100, 1000, 10000], "bracket_midpoint_test_does_not_certify_high_precision": True, "synthetic_midpoint_error": "1/2000", "correct_n_minus_half_coefficient": "7/6", "universal_cos_phase_difference_lower_bounds": bounds, "scope": "Exact rational controls for the accompanying proofs; no original constant, prime sample or large angle sum was recomputed.", }, sort_keys=True, indent=2))