Plectis

Long paper

The Binary Totient Series

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

Summary. The dyadic totient sections through level e≥1 have an explicit rational basis of size 2e+1. Truncating a scaled tail difference produces an integer whose residue certifies nonintegrality when its distances from both endpoints of the residue interval exceed an explicit error bound. The record develops the resulting finite denominator exclusions, equivalent residue criteria, and sufficient exponential-sum estimates. Rational comparison sequences identify the limitations of particular size, parity, rank, and finite-prefix arguments. The short paper supplies the all-base basis theorem; here each conditional result carries the arithmetic hypothesis still needed to apply it. Those hypotheses are not established in the form required to prove irrationality of S=∑ φ(n)2−n.

This paper covers a claim-bounded problem-specific reasoning surface for Erdős #249: selected checked premises, finite certificates, closed routes, surviving obligations, and their exact evidence bands.

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

In this paper

An exact endpoint identity

Under the bounds below, positivity places an integral tail difference at the upper residue endpoint. A one-sided inequality would exclude it. That additional inequality is a sufficient condition, and is not claimed to be strictly weaker than irrationality.

Theorem 9.12 (The proved implications). For every a≥8 and every J,K,m inside the sign corridor (J+K+(a+6)<2⋅2a), a one-sided residue gap at precision m≤K (size condition 2H+J+K+2<2m and D(H,H+J,K)mod2m≤2m−(2H+J+K+2)) already forces R(2H+J)−R(H+J)∉Z. No lower margin at all is demanded. The proof chain is complete: the theorem holds for every a≥8, and cofinal upper-endpoint condition ⇒ Irrational S is proved.

Definition 9.13 (The unproved quantified condition). The upper-endpoint condition is

∀a0 ∃a,K,m, a0≤a ∧ 8≤a ∧ K+(a+6)<2⋅2a ∧ Ga(0,K,m).

No unconditional statement anywhere in the record locates the residue of the diagonal word D(H,H,K) (where H=H(2a)) below the top strip at even one large a. The condition reduces further to the last m differences δ2a(j) in the sum D(H,H,K) (actualLcmTopEdgeResidueGap_iff_terminal). PowerTwoActualLcmTopEdgeResidueGapSupply

Proposition 9.14 (Five sufficient conditions). Each of the five conditions below suffices for irrationality; none of them is proved. The first four imply the upper-endpoint condition; the fifth gives nonintegrality directly by the endpoint identity. These are not asserted to form a linear hierarchy. Here H=H(2a), and every condition quantifies over arbitrarily large exponents a.

  1. Adjacent-suffix band:

    ∀a0 ∃a,m, a0≤a∧8≤a∧m+1+(a+6)<2⋅2a∧2H+m+3<2m∧
    2H+m+2≤suffix residue(2a)0m≤2m−(2H+m+2)

    (a two-sided band on the adjacent-suffix residue directly, one candidate depth m).

  2. Odd-prefix interval at the prescribed depth: at the prescribed odd depth 2q+1, a two-sided band of half-width H+q+2 on the half-word residue modulo 4q. The depth is fixed by q=qa; it cannot be chosen independently of a.

  3. Centred-residue bound at the prescribed depth, proved equivalent to the previous one:

    ∀a0 ∃a,q, max(14,a0)≤a∧q=qa∧H+q+2≤|ua,q|.
  4. Centred-residue bound at a variable depth: the same magnitude bound with the depth restriction relaxed from the prescribed value q=qa to any odd 2q+1 satisfying the half-cell fit 2(H+q+2)≤4q and the positivity range 2q+2+(a+6)<2⋅2a.

  5. Terminal dominance: under the same bounds as item 4, δ2a(2q+2)≤2ua,q. This is a different one-sided comparison, treated immediately below.

For the first four conditions, the relevant implications into the upper-endpoint condition are as follows: adjacent-suffix band → upper-endpoint condition; odd-prefix interval at the prescribed depth → adjacent-suffix band; centred-residue bound at the prescribed depth ⇔ odd-prefix interval at the prescribed depth; centred-residue bound at a variable depth → adjacent-suffix band; centred-residue bound at the prescribed depth → centred-residue bound at a variable depth.

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:2be13b340f9dafc4. 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.