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

Finite extension and cofinal estimates

Extending a computation supplies more finite witnesses. To reach a cofinal statement, an argument must instead produce a witness beyond an arbitrary threshold. The examples below specify which of these extensions is needed; the largest computed scale is not asserted to be a limit of the method.

  1. Finite certificate tables. Results such as the diagonal certificates at 28 explicit values of t through t=64, now a strict subset of the aggregate band t≤82 (certifiedKill_diagonal_all_imported), the certificates for h∈[1,8] at fixed depth 16 (certifiedKill_all_small), and the exclusions for h∈[1,16] at exponent 14 (totient_series_ne_rat_of_den_dvd_pow_two_mul_mersenne_upto_sixteen) are each a finite list of independently verified rows, not a single argument instantiated at a free parameter. The existing lists do not establish further rows; an extension needs either additional computations or an argument for a family of parameters.

  2. A bounded window inside a uniform theorem. The rough-integer bound of Proposition 6.79 and the positivity theorem of Proposition 6.84 hold for every a≥8, subject to their stated bounds on the other parameters. In the sign theorem, for example, J+a+6<2⋅2a. Their proofs are therefore not merely enumerations of a fixed set of exponents. The missing conclusion is a suitable residue inequality at arbitrarily large scales, not extension of the range of a in the positivity theorem. No complexity lower bound follows from these examples.

  3. Parameter dependence in an approximation estimate. For reduced approximants pK/qK to S, the conditions 0<|S−pK/qK|≤εK and qKεK→0 imply irrationality. A growing denominator alone does not control this product. In particular, the exact reduced-denominator formula of Proposition 6.8 concerns a specified finite Möbius sum; it does not estimate the complementary tail. Likewise, a bound proved with a constant depending on a fixed auxiliary parameter is not automatically uniform when that parameter grows. Both the dependence of the constant and the error estimate must be retained in any passage to an unbounded family.

The missing arithmetic inputs include the stated constant-saving exponential-sum estimate and an upper-endpoint residue inequality. For the positivity theorem, the unresolved step is exclusion of that residue interval, not positivity at more exponents.

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.