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

The original quantified residue condition

The threshold quantifier excludes every possible starting point for a rational tail period.

The quantified residue condition.

S∉Q⟺∀h≥1 ∀N0 ∃N≥N0 ∃L,C(h,N,L).

Here C(h,N,L) is the finite residue test defined earlier; the universal quantifiers over h and N0 belong to the displayed assertion, not to that finite test. Erdos249257.TotientTailPeriodKiller.irrational_totient_series_iff_certificate_supply The equivalence is proved; the quantified existence assertion is not proved.

The reverse direction is by contradiction against the tail-period law: if S were rational, the eventual-period theorem (Erdos249257.TotientTailPeriodKiller.eventual_period_of_not_irrational, unconditional) supplies a period h>0 and pre-period N0 with RN+h−RN∈Z for all N≥N0; the certificate hypothesis instantiated at that (h,N0) produces an N≥N0 where RN+h−RN∉Z, a contradiction via nonintegrality from a certificate (Erdos249257.TotientTailPeriodKiller.tail_diff_notMem_int_of_certifiedKill).

For the forward direction, irrationality gives pointwise non-integrality of every positive tail shift and certificate completeness supplies a witness already at N=N0.

For fixed h, the required certificate may choose both N≥N0 and L. It is not required at every N or every depth. Its error radius is N+h+L+2, so for fixed h,N it grows only linearly in L, whereas the modulus is 2L. The missing assertion is that an admissible residue lies outside both endpoint intervals beyond every threshold, for every positive h. The reformulations below specify other ways to choose such witnesses; none establishes this assertion for the actual totient sequence.

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.