Plectis

Long paper

Reciprocal Mersenne Subseries

Summary. A weighted summability criterion proves irrationality of reciprocal Mersenne subseries: if h is the part of a supported on a finite nonempty prime set P, every infinite A with ∑ h(a)/(a(bh(a)−1)) finite has irrational ∑ (ba−1)−1. The base-two condition gives the conclusion at every integer base for every infinite subset, and permits an example with divergent reciprocal sum, while excluding full support and all odd exponents. The proof averages over a finite part of the support and over dyadic observation lengths. Erdős's weaker reciprocal-summable theorem is proved in full, and a common window extends both arguments to unions of weighted and positive-cover supports. Finite-denominator and achievement-set calculations formulate tests for the targets 1/2 and 1/21; those tests do not decide either target or the universal question. Prime support at base 2 and squarefree support at power-of-two bases are attributed as existing work.

This paper covers a claim-bounded problem-specific reasoning surface for Erdős #257: selected checked premises, finite computations, 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 #257, whose universal and half-value questions remain open.

In this paper
Possible estimates to prove

A conditional bound along a right-branch run.

Let r≥6, L≥1, and suppose that the transitions at rows r,…,r+L−1 all take the right branch. Put ws=rem(s)−2s and let ps be the lower-prefix pulse, so 0≤ps≤2(s−2). Iterating the exact recurrence ws+1=4ws−4−ps gives

wr+L=4Lwr−∑j=0L−14L−1−j(4+pr+j).

The reverse triangle inequality and the finite geometric sum give

|wr+L|≥4L(|wr|−4+2(r+L)3).

This estimate alone does not force a right-branch run to end. For that conclusion one also needs an upper bound on its terminal deviation. More precisely, if C>0 and

|wr+L|≤C2r+L,|wr|>4+2(r+L)3,

then division by 4L and taking logarithms give

L≤r+log2⁡C−log2⁡(|wr|−4+2(r+L)3).

Every term and hypothesis is explicit here. A separate window estimate must supply the displayed terminal upper bound; it does not follow from the right-branch recurrence alone. This explains the possible connection between the initial deviation and the run length without asserting a sharp threshold, a run-length equivalence, or an unproved bound for all later rows. This conditional calculation is an ordinary argument.

An exact finite phase experiment.

For the 200,000 integers 106≤M<1.2×106, an integer divisor sieve through 1,200,039 computes 240Θ40(M) exactly. Reducing that integer modulo 240 gives the following counts and empirical proportions for dist⁡(Θ40(M),Z)<t.

t 2−6 2−8 2−10 2−12 2−14
Count 7083 1858 491 125 37
Proportion 0.035415 0.009290 0.002455 0.000625 0.000185
Proportion/t 2.267 2.378 2.514 2.560 3.031

The experiment samples consecutive integers, not reset rows. Its median distance is 0.24470815549…, compared with 1/4 for a uniform fractional part. A uniform fractional part has probability 2t of distance less than t, for 0<t≤1/2, which explains the comparison in the last row. Agreement of a finite histogram with that model is not a distribution theorem.

Truncation matters at the smallest tested thresholds. With the same starting indices, the counts below 2−14 are 22,36,37,37 for L=16,24,32,40, respectively. Thus similar central quantiles do not justify ignoring the truncation error in a rare-event test. More generally, for L′≥L≥1 and B≥0, if τ(M+i)−1≤B over L<i≤L′, then

0≤ΘL′(M)−ΘL(M)≤B(2−L−2−L′)≤B2−L.

Distance to the nearest integer is 1-Lipschitz. A threshold comparison is therefore guaranteed to remain unchanged when the distance at the shorter cutoff is farther than this error from the threshold. This is a sufficient stability test, not a necessary one. The estimate uses a bound over the specified finite range, not an unproved uniform bound on the divisor function.

A probabilistic application requires further assumptions. For example, if events Er in a specified probability space satisfied P(Er)≤C2(3−r)/2 for every r≥R, the union bound would give

P(⋃r≥REr)≤C2(3−R)/21−2−1/2.

Summability would also imply only finitely many failures almost surely, not zero failures at every index. Neither the finite histogram nor its fit to a uniform-phase model proves these probability bounds, identifies their events with reset failures, or defines a probability for the actual deterministic orbit. In particular, no membership conclusion is drawn from small expected counts computed in such a model. The counts are exact finite computations; the error and probability inequalities are ordinary arguments; an application to resets is unproved.

The reset signs and the exact branch identities. Write ps for the nonnegative lower-prefix pulse and ws=rem(s)−2s. On a middle transition, where the upper carry does not occur, the update is

rem(s+1)=4rem(s)+2s+1−ps,ws+1=4ws+2s+2−ps=4rem(s)−ps.

The natural-number subtraction can be read as signed subtraction because ps≤2(s−2)<2s+1 for s≥5. The middle-branch condition is 4rem(s)<2s+1+4+ps, together with failure of the upper carry. Thus a positive middle-reset deviation is exactly the additional inequality 4rem(s)>ps. The pulse bound and branch inequality alone do not prove it: s=5, rem=1, p=5 satisfy both numerical bounds but give 4rem−p=−1. This is a counterexample to those numerical premises, not a claim that the concrete orbit reaches that state.

On an upper transition, let os>0 be the overshoot and ps+≥0 the upper-prefix pulse. The carry condition pays the subtraction, so

ws+1=−(4os+ps+)<0.

This sign already follows from the exact upper-branch identity; only the middle sign needs further orbit information. On a right transition the corresponding formula is ws+1=4ws−4−ps. These identities separate the sign calculation from the unproved magnitude estimate needed for square-root escape. At the reported middle step s=14, for example, rem(14)=392, p14=3 and rem(15)=34333, giving w15=1565.

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:47cf6a152738f17c. 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.