Erdős–Graham conjecture on square products of factorials

For n≥2n\ge 2, define F(n)F(n) to be the least integer r≥2r\ge 2 for which there exist integers 1≤a1<⋯<ar−1<n1\le a_1<\cdots<a_{r-1}<n such that n! a1!⋯ar−1!n!\,a_1!\cdots a_{r-1}! is a perfect square. For r≥2r\ge 2 and X≥1X\ge 1, let Dr(X)=#{n≤X:F(n)=r}D_r(X)=\#\{n\le X:F(n)=r\}. Determine the order of growth of Dr(X)D_r(X) as X→∞X\to\infty for 3≤r≤63\le r\le 6. Erdős and Graham conjectured, in particular, that D6(X)≫XD_6(X)\gg X; the three-factor case was expected to have square-root order, D3(X)≍XD_3(X)\asymp\sqrt X.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed progress

An unrefereed preprint claims the remaining three-, five-, and six-factor growth rates have been determined, but the claims have not been independently checked.

Erdős and Graham posed questions about when products of several factorials are squares and how frequently this occurs, including the three-factor case and analogous cases with more factors. Their 1976 work left the relevant growth questions open.

Known results

  • Erdős and Graham, 1976: conjectured a square-root-order count for the three-factor case and recorded examples, but did not prove the conjectured asymptotic.

October 2026 development

Fedir Yudin’s preprint claims the five- and six-factor growth rates and the precise asymptotic scale for the three-factor case, thereby covering the cases posed by Erdős and Graham. A related preprint gives a three-factor count of x1/2+o(1)x^{1/2+o(1)}. These are unrefereed claims, not independently verified results.

Current status (as of October 2026): Growth claims for the three-, five-, and six-factor cases are reported but unverified; no independently confirmed complete resolution is recorded.

Sources

Solutions 0

No solutions have been posted yet.