Erdős Problem #373 — Factorial product equations
For positive integers and integers , with
ask whether there are only finitely many tuples satisfying
The strict inequality excludes the trivial cases with : in those cases the equation reduces to . Erdős Problems, #373
Background
Erdős raised this question in his work on prime factors of consecutive integers and related Diophantine problems. In that setting, the size of the largest prime factor of can constrain a factorial identity: a prime dividing or may force a large factor on one side of the identity. The condition matters because taking leaves precisely the possibility that the remaining factorials multiply to . Erdős (1976) Erdős Problems, #373
Surányi conjectured that the only nontrivial solution in the two-factor case is . Hickerson, as reported by Erdős, conjectured that the nontrivial solutions when the number of factors is unrestricted are exactly
These are conjectured examples, not a classification established by the results below. Erdős (1976) Erdős Problems, #373
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.