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

Sources and evidence

The margin marks and the table below identify the recorded Lean statements and supporting formulas at their original revisions. A link to a nearby statement does not certify a further deduction in the prose. The two partial-sum cancellations, the index-52 example and the continued-fraction enclosure use the finite integer calculations described above. The carry computation through 300000 uses a separate exact-interval computation outside Lean, described in §6.

Statement

Lean statements of its steps
Statement Lean statements of its steps (continued)

Theorem 2.1

maximal-power survival, with the residue formula and the denominator form
Proposition 2.2 first prime occurrences at arbitrarily large indices; the reflected divisibility
Theorem 4.1 failures of divisibility for the next integer; denominator exclusions: the size bound and the factorial nondivisibility
Proposition 4.2 factorial residues and rationality
Proposition 4.3 the equivalent fractional-part inequality; the finite window, the irrationality implication, the classification (22), the radius bound
Theorem 4.4 the criterion for the shifted series; the escape form, the member t=−1, and the irrationality of e
Theorem 5.1 the prime-parameter specialization; the margin mark gives the natural-parameter statement; the coprimality (24)
Equation (27) the two simultaneous inequalities, the floor identity, the irrationality implication
Removal of a fixed denominator factor a fixed factor eventually divides the factorial
Weight identities used in Theorem 1.1 and (1) integrality of the weights, the denominator-times-weight identity
Theorem 3.5 finite radius bound; the sequence form, the little-o form
Changing one weighted sum Vp adjustment at sufficiently large indices, the residual identity
Equation (31) doubled-prime criterion
Canonical factorial digits termination equivalence
Amplification modulus divisibility, nonvanishing

Attribution. Wilson’s theorem and the Wilson reflection identity are classical, the latter recorded by Stewart [8]. The factorial-digit termination criterion goes back to Cantor [5]; Koepf and Schmersau prove its irrationality direction for digits that are not eventually maximal [9], and Galambos treats rationality criteria for Cantor series [6]. Here the identity C=S−e+2 gives the eventual digit value m−2 and extends to the shifted family. The comparison with Hančl and Tijdeman [11] concerns factorial scaling: their lemma makes a scaled tail integral, whereas the proof in §4 identifies the next integer above a generally nonintegral scaled partial sum. The multiplicity bound is Garaev, Luca and Shparlinski’s [7], and the lcm deduction from it is not theirs. The divisibility in Lemma 3.2 is the case P=−1 of the relation used in the proof of Lemma 5 of Luca and Shparlinski [13] and at display (2.5) of Lai [14]. The nonvanishing cutoff for polynomial shifts is Lemma 3 of [13], restated with the bound n!+P(n)>1 in [14]. The survival criterion is a specialisation of Louwsma and Martino’s valuation formula [4]. The single-denominator growth criterion is Erdős’s [3], and the continued-fraction identities are those of [17]. The deductions from Wilson’s theorem, the conditional finite support bound and Theorem 3.4 are proved above. No further priority claim is inferred from this comparison.

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.