arXiv (All)
open access
Square products of factorials and a conjecture of Erdős and Graham
For $n\ge2$ let $F(n)$ be the least $k\ge2$ such that $n!$ is the largest factor in a product of $k$ distinct factorials that is a perfect square, and let $D_k(X)$ be the number of $n\le X$ with $F(n)=k$. Erdos and Graham asked for the order of growth of $D_k(X)$ for $3\le k\le6$, and conjectured th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Classification of prime graphs with 2-switch-degree at most 4#1154535
- A quadratic refinement of Jackson's \CE\ condition for Hamilton cycles in digraphs#1048687
- How large can $B_n$- and $D_n$-friezes be?#1106236
- Prime-Power Lock-In in Concatenation Recurrences: An Exact GCD Law and OEIS A070823#824766
- In Re: Kevino Graham#410622
Record · ID 1157170
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive