Skip to content

Erdős problem 729

Start work

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

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:5402fe31d74ed329599c6934171e950aba14c2b118deb48f9efe9ab942126af0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON