Plectis

Long paper

Factorial Linear Forms and Denominators: Detailed Proofs and Rationality Criteria

Erdős #68 By 1 September 2026; revised 7 October 2026 Authorship, AI use and citation

Summary. The record proves liminf (log LN)/(N3/2 log N) ≥22/3 for L_N=lcm(2!−1,…,N!−1), by comparing a terminal block of denominators with pairwise gcds rather than an external multiplicity theorem. Specialising a Louwsma–Martino valuation, it exhibits primes 139 and 2593 absent from all later reduced denominators. Coefficient constructions give integer forms MS+k; at fixed moment the remainder changes only by an integer. Rationality criteria use factorial digits and the next integer above a scaled partial sum; the digit argument also recovers the irrationality of e. Two exact calculations give q∤299999! and q≥239990>1012038. These exclusions do not prove irrationality.

This paper covers the complete problem-specific reasoning surface for Erdős #68, including all registered result families and their boundaries.

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

In this paper

Guide to the formal sources

Lean source links (115)

This concordance lists the floor, support and divisibility identities used alongside the principal results. All links retain their original source revisions. The last subsection contains the historical links from the short paper, with their targets unchanged.

Source links from the short paper

These links collect the declarations formerly listed in the short paper’s source appendix, at the same historical revisions and paths. They supplement the concordance above. No fresh compilation or independent review is asserted by a link, and a theorem about a conditional family leaves its hypotheses to be established.

The remaining links from the short paper use revision 99f4bf47422a; the links in the preceding concordance use this record’s own revision. The following numbers link to source lines within each named module, retaining both revisions where they differ.

AdjacentUnitCarryWindow.lean
ChannelBreakpointRigidity.lean
ChannelIntegralCongruence.lean
DivisorFactorialCentre.lean
EndpointWeightedPrivateSupport.lean

4766.

FactorialChannelCertificate.lean
FactorialZeroPlateau.lean
PrimeUnitTranslator.lean

1559.

PrimeZeroBranch.lean

6099.

The hypotheses about short intervals, least prime factors, and the nonzero real remainders are stated in the mathematical sections above. They remain hypotheses when a declaration link is followed.

Earlier links for the consolidated criteria.

The four criteria treated here retain the short paper’s earlier source and comparison links below. These identify historical declarations and recorded comparisons; they are not new executions.

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:0af0d85ec1beab46. 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.