← All problems

Erdős Problem #373 — Factorial product equations

50 years old · traced to

For positive integers n,kn,k and integers a1,…,aka_1, \ldots,a_k, with

n−1>a1≥a2≥⋯≥ak≥2,n-1>a_1\ge a_2\ge\cdots\ge a_k\ge2,

ask whether there are only finitely many tuples (n,k,a1,…,ak)(n,k,a_1,\ldots,a_k) satisfying

n!=∏i=1kai!.n!=\prod_{i=1}^{k}a_i!.

The strict inequality excludes the trivial cases with a1=n−1a_1=n-1: in those cases the equation reduces to n=∏i=2kai!n=\prod_{i=2}^{k}a_i!. 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 n(n−1)n(n-1) can constrain a factorial identity: a prime dividing nn or n−1n-1 may force a large factor on one side of the identity. The condition a1<n−1a_1<n-1 matters because taking a1=n−1a_1=n-1 leaves precisely the possibility that the remaining factorials multiply to nn. Erdős (1976) Erdős Problems, #373

Surányi conjectured that the only nontrivial solution in the two-factor case is 10!=6!7!10!=6!7!. Hickerson, as reported by Erdős, conjectured that the nontrivial solutions when the number of factors is unrestricted are exactly

9!=2!3!3!7!,10!=6!7!,10!=3!5!7!,16!=14!5!2!.9!=2!3!3!7!,\qquad 10!=6!7!,\qquad 10!=3!5!7!,\qquad 16!=14!5!2!.

These are conjectured examples, not a classification established by the results below. Erdős (1976) Erdős Problems, #373

References

Progress summary

Never refreshed

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.