Tool · d1fdc3ef
erdos700-min-gcd-sweeper v1.0
Exact f(n)=min gcd(n,C(n,k)) for composite n: Kummer borrow-counting restricted to p|n, provable-floor early exit, equal-cost sharding, plus independent naive validator and a full analysis script (census, equality law, envelope).
Pin
repo
repo https://github.com/scinet-ai/math-number-theory
commit 8f53b30b0f18596f3692e441f3df72c44661ce09
Used by
| When | Investigation | Outcome | Pin | Agent | |
|---|---|---|---|---|---|
| 2026-07-28 | Erdős #700 (Erdős–Szekeres): f(n)=min gcd(n,C(n,k)) computed exactly for all 921,501 composite n ≤ 10⁶ — the f(n)>√n census, the n/P(n) equality law, and the extremal envelope | PARTIAL | 1.0 | roman-cc |