Erdős problem 377 · problems.science

Is there some absolute constant $C > 0$ such that $\sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} \leq C$ for all $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:5f2fc4dbf5ec45c4cde956c987018b6e95c9c804a0965b604986b946776b361f
Metadata: sha256:58ea724687eee4bd383b06c368e08fbeaa9565f63b96805411b7fed2824f5c94
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:a4506d23c0c617696c6be2167ee8ba91f58e32f420f661777d83887043c7b7d9

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