Erdős problem 386 · problems.science

There is a $k$ , such that $2 \le k \le n - 2$ and $\binom{n}{k}$ can be the product of consecutive primes infinitely often?

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:54ad7739942fa243b509c7813d156e8d847b2f55598d2eaf07347a817cd32b5d
Metadata: sha256:661d98637302f25c3d50b731f0361c5ee3824bc3e0a157f93e15aa4cdc6961c2
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:882693983cb6fdd6163d08d46989d78f1b7b1634b34c4e42c67bdfca6d91184f

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207