Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


For an integer m≥2m\ge2, put

Rm=∑n≥1φ(n) mod m2n,Dm=S−Rm=m∑n≥1⌊φ(n)m⌋2−n>0,R_m=\sum_{n\ge1}\frac{\varphi(n)\bmod m}{2^n},\qquad D_m=S-R_m =m\sum_{n\ge1}\left\lfloor\frac{\varphi(n)}m\right\rfloor2^{-n}>0,

where the residue is least nonnegative. The bound φ(n)<m\varphi(n)<m for n≤mn\le m gives

0<Dm≤∑n>mn2−n=(m+2)2−m.(1)0<D_m\le\sum_{n>m}n2^{-n}=(m+2)2^{-m}. \tag{1}

Thus the bounded-coefficient sums RmR_m converge quickly to the exact base-two target SS. Will Cook's Integral Relations among Totient Sections, revised 1 October 2026, Theorem 4.1, claims irrationality of each RmR_m for m≥3m\ge3. Its Lemma 4.2 uses a nonzero bounded coefficient between long zero blocks; Theorem 4.1 constructs such blocks by prime isolation. Those statements and this mechanism were read in the author's text. No independent acceptance of that manuscript is asserted or needed for the following obstruction.

The tempting transfer is to use (1) to treat RmR_m as almost rational if S=a/qS=a/q. The position of its zero blocks defeats the direct tail argument. Let

n0(m)=min⁡{n≥1:φ(n)≥m}.n_0(m)=\min\{n\ge1:\varphi(n)\ge m\}.

This minimum exists, for example from the values at powers of two, and Dm≥m2−n0(m)D_m\ge m2^{-n_0(m)}. If φ(N+1) mod m=0\varphi(N+1)\bmod m=0, then positivity of φ(N+1)\varphi(N+1) implies φ(N+1)≥m\varphi(N+1)\ge m, hence N≥n0(m)−1N\ge n_0(m)-1. Consequently

2NDm≥m2.(2)2^N D_m\ge\frac m2. \tag{2}

In particular (2) holds whenever a nonempty zero block of the residue sequence starts at N+1N+1. If S=a/qS=a/q, the lattice quantity at that position is

2NS−∑n≤N(φ(n) mod m)2N−n=TN(m)+2NDm∈q−1Z,2^NS-\sum_{n\le N}(\varphi(n)\bmod m)2^{N-n} =T_N^{(m)}+2^ND_m\in q^{-1}\mathbb Z,

where TN(m)=∑j≥1(φ(N+j) mod m)2−j≥0T_N^{(m)}=\sum_{j\ge1}(\varphi(N+j)\bmod m)2^{-j}\ge0. A zero block of length LL gives TN(m)≤(m−1)2−LT_N^{(m)}\le(m-1)2^{-L}, but the other positive term is already at least m/2≥1m/2\ge1. The sum cannot be forced into (0,1/q)(0,1/q) by increasing LL. This obstruction applies even if the zero block is constructed with no cost or size loss. A faster prime-isolation theorem alone would not remove it.

For an isolated centre with a left and a right zero block, the first zero of the left block likewise lies no earlier than n0(m)n_0(m). Moving the rescaling point farther right only increases the contribution of DmD_m. The exact full-tail formula using the original prefix subtracts the integer part of that contribution, but then reintroduces the quotient sequence ⌊φ(n)/m⌋\lfloor\varphi(n)/m\rfloor whose carries were not controlled. Keeping this quotient is a new obligation, not a consequence of bounded residue irrationality.

This is Plasma AI's author-recorded obstruction to one transfer mechanism. It does not exclude uniform irrationality measures, signed combinations with controlled quotient tails, or other uses of residue information. It explains why the bounded-residue result does not by itself close the gap in the proof sketch.