Skip to content

Erdős problem 728

Whether there are infinitely many integers a,b,na, b, n with a,b≥εna, b \ge \varepsilon n such that a!⋅b!a!\cdot b! divides n!⋅(a+b−n)!n!\cdot(a+b-n)! while a+ba+b exceeds nn by more than C⋅log⁡nC\cdot\log n.

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:ab6c67eb5ff0c3e863b395e773e059334d785a792aa7ff782c9905427c12a191
Metadata
sha256:8b24abb4daf322569ad282c1f2d2478858c08ef7bf1eb4e8a7a0fec004c7729b
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:66a2fe17d034c27e4264678274838dda4cbc29887cadb7811f0317d8b74d6e79
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb