Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
For an integer , put
where the residue is least nonnegative. The bound for gives
Thus the bounded-coefficient sums converge quickly to the exact base-two target . Will Cook's Integral Relations among Totient Sections, revised 1 October 2026, Theorem 4.1, claims irrationality of each for . 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 as almost rational if . The position of its zero blocks defeats the direct tail argument. Let
This minimum exists, for example from the values at powers of two, and . If , then positivity of implies , hence . Consequently
In particular (2) holds whenever a nonempty zero block of the residue sequence starts at . If , the lattice quantity at that position is
where . A zero block of length gives , but the other positive term is already at least . The sum cannot be forced into by increasing . 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 . Moving the rescaling point farther right only increases the contribution of . The exact full-tail formula using the original prefix subtracts the integer part of that contribution, but then reintroduces the quotient sequence 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.