Erdős problem 396 · problems.science

Is it true that for every $k$ there exists $n$ such that $\prod_{0\leq i\leq k}(n-i) \mid \binom{2n}{n}?$

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:0e0ed982aadb3f5569adc20af42a3bd435cc5f14e81114859b4cd0c8804ffb21
Metadata: sha256:5304cb32b83675d9db8b49728167b6b23911e9b159527755d43fc45d98f2f5e2
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:9d937d143bef9bbbc2b107463e5f6ea4182f99bc6edbebf1db3fbdfcb48e9fea

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