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

Changing the coefficients after a finite prefix

Proposed argument. The quantified residue condition requires certificates beyond every starting index. A finite computation can check many instances, but one fixed inspection bound cannot establish these quantifiers. The following comparison explains this limitation without making any claim about all possible irrationality arguments. Erdos249257.TotientTailPeriodKiller.irrational_totient_series_iff_certificate_supply

Counterexample. Theorem 2.4 gives an explicit splice construction; its series value, exact reduced denominator and failure of the separation condition are checked in Lean. Choose an integer P>B, set γ(n)=φ(n) for n≤B, and γ(n)=n−1P∣n for n>B. Then 0≤γ(n)≤n, and the binary series ∑γ(n)/2n is rational: it is a finite rational prefix, plus the tail of ∑nn2−n, minus a geometric sum over the multiples of P beyond B. Because γ agrees with φ on every index ≤B, γ passes every finite certificate that only inspects indices ≤B; in particular it passes or fails every instance of C(h,N,L) with N+h+L≤B exactly as φ does. Yet ∑γ(n)/2n∈Q by construction.

Scope. For each fixed bound B, a different rational comparison sequence can agree with φ on all inspected coefficients. This rules out a deduction from that finite prefix alone. It does not rule out a proof that establishes the required instances for arbitrarily large B with the correct quantifiers. Such a proof would no longer be a single finite inspection. The comparison also does not preserve multiplicativity or every other arithmetic property of φ.

Consequence. The finite-prefix example and the parity example below are distinct constructions. The former preserves a prescribed finite prefix; the latter preserves parity and has separated nonperiodic blocks. Each shows why its own list of assumptions is insufficient. The recorded finite diagonal examples remain useful individual certificates, but their number alone gives no assertion at arbitrarily large scales. Erdos249257.TotientTailPeriodKiller.certifiedKill_diagonal_all_imported_through_t64

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.