Long paper
The Binary Totient Series
Summary. The dyadic totient sections through level
Start here, by the editorial route
In this paper
Verification and reproducibility
The links below identify formal declarations at the supplied source
revisions. A checked conditional implication retains its hypothesis; the
linked source alone does not establish that input for
Bases and relations.
reduction of sections with residue zero; reduction of even residues; independence; span equality; basis; independence; dimension; the exact finite-truncation rank; infinite-dimensionality directly; coordinate specification; injective residues; unique representation; level count; section-index count; index as two plus the odd-residue count; full index count; a nonzero evaluation determinant; an invertible minor for affine totient sections; power-multiplication identity; affine cross-gcd identity; nonzero reduction scalar; all-base residue step; canonical spanning; span equality; rank in every base from independence; all-base truncation rank from independence; independence in every integer base; the rank of the retained all-base family; the rank of all sections through a finite level.
Tail identities, residue tests and carries.
the
finite-prefix and tail identity; definition;
certificates
for shifts 1 through 8; nonintegral
tail differences at the checked shifts; the
integer carry recurrence and its growth bound; residue
recurrence; comparison
of the two residue conditions; exact
equivalence; a
certificate in each sufficiently late pair of multipliers; pointwise
equivalence; global
equivalence; equivalence
after setting depth equal to the shift; irrationality
and arbitrarily large certificates; the
carry-rank lower bound under rationality; carry
rank at least
Finite denominator exclusions.
exclusion; reduced-denominator form; first failure; the conditional implication; farey gap; the denominator bound at window 240; denominator exclusion from a finite interval; the earlier denominator bound at window 120; denominator exclusion for the coprimality probability; list; verification; certificates at every scale through 82.
Least common multiples and limits of the tested methods.
certificate
completeness; tail-difference
integrality; irrationality
iff every tail difference is nonintegral; exact
frontier; forward
implication; positive
tail differences; negative
endpoint representative; residue
near the upper endpoint; divisibility
preserved by finite combinations of shifts; the
counterexample with sparse prescribed values; pointwise;
cofinal
at each shift;
Möbius identities and rational approximation.
unique
minimizer; uniform
lower bound
Proposed exponential-sum and prime-factor estimates.
window-separated
pairs; the
unproved quantitative separation condition at primes; a
positive adaptive truncation budget;
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.