Plectis

Long paper

Running least common multiples: distinct values and multiplicities

Erdős #269 By July 2026; revised 5 October 2026 Authorship, AI use and citation

Summary. For the prime set {2,3,5}, a five-map argument proves irrationality of the sum over distinct running LCMs. Two-prime sums reduce to a transcendental Hecke–Mahler value. For the repeated three-prime sum, an equivalent residue criterion leaves an arithmetic condition open. Complete ordinary arguments for general distinct-running-LCM sums and prime-power subseries are retained as remarks awaiting formalisation.

This paper covers distinct-height irrationality, all-rank kernel structure and the repeated-sum tail criteria, preserving the multiplicity distinction and the remaining open residue-window obligation.

It does not establish the validity of claims tagged Lean, which belongs to the cited kernel-checked source, or a solution to Erdős #269, which remains open.

In this paper

About this paper

Authorship and AI use. Will Cook built and directed the research infrastructure and maintains the public release. He reviewed claims when he could. AI agents did most of the research and drafting. Cook did not independently verify every claim.

Cite and contact. Cite this paper by its title, author and date above, with its PDF; cite the earlier sources it uses for a mathematical result. For software, use the release citation and give the commit used. Contact Will with questions or corrections.

Prefer the manuscript?

Equations typeset from the exact TeX. Rendered from the LaTeX manuscript source with file fingerprint sha256:27b68b4b0cf24ce2. Its file fingerprint matched the published source record, so the PDF above, the LaTeX, and this page are one manuscript. Redeploying the site regenerates this page from whatever the public repository holds at that moment.