Skip to content

Erdős problem 729

Let C>0C>0 be a constant. Are there infinitely many integers a,b,na,b,n with a+b>n+Clogna+b> n+C\log n such that the denominator of n!a!b!\frac{n!}{a!b!}contains only primes C1\ll_C 1?

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:7690b2b1b782e9b58197c71ab34ecbc7398834c22e1ec978cb3c25c2dff72427
Metadata
sha256:727284bc3eff44a49f4c6890631408b6b5e3602b9261feb1d4bf32405745d441
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:5402fe31d74ed329599c6934171e950aba14c2b118deb48f9efe9ab942126af0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page