Erdős problem 728 · problems.science

Whether there are infinitely many integers $a, b, n$ with $a, b \ge \varepsilon n$ such that $a!\cdot b!$ divides $n!\cdot(a+b-n)!$ while $a+b$ exceeds $n$ by more than $C\cdot\log n$ .

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#728
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI alongside literature
Erdős AI contributions wiki · 6 Jan, 2026
Machine
Aristotle, GPT-5.2 Pro
Open the source record
Formalization
Erdős AI contributions wiki · 22 Jan, 2026
Machine
Aristotle
Open the source record
argument
VibeMathed
Machine
Aristotle (Harmonic) + GPT-5.2 Pro
People
Boris Alexeev, Kevin Barreto, Liam Price, Nat Sothanaphan
Reported outcome
resolved
Open the source record

Reported activity

Search problems.science