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
The integer update in a middle interval

The following identities explain the two-sided bound and the reset-band condition used above. They also distinguish the signed middle coordinate Cs=4rem(s)−ps−−4 from the nonnegative label in the next estimate.

Proposition 6.140 (The unsafe middle range is exactly three integers). For s≥5, write R=rem(s) and P=ps−. Since 4R−P−4 is an integer,

¬(4R−P−4≤−4 ∨ 0≤4R−P−4) ⟺ 4R−P−4∈{−3,−2,−1}

The complement of the two safe integer ranges is precisely {−3,−2,−1}. The conclusion is only a classification; excluding any of these values requires an additional argument.

For a row s≥5, set

Es=∑d∈Ds{4s2d−1},Zs=rem(s)−Es,c=4rem(s)−ps−=Cs+4.

Here braces denote fractional part. Assume c≥0, as in the linked statements below. In particular, the exceptional signed values Cs=−3,−2,−1 correspond to c=1,2,3, not to negative labels. The floor-quotient recurrence gives ps−≤4Es, and hence

4Zs≤c.

This inequality has a Lean proof (seamMiddleCell_four_mul_floorZ_le). On a middle transition Ds+1=Ds. Writing ρ=1/2−XDs(2), the exact quotient identity therefore gives

4s+1ρ=2s+2+4Zs≤2s+2+c,

also proved in Lean (seamMiddleCell_scaledRationalRemainder_le).

For Cs=−3, the correct label is c=1. This estimate does have a local consequence: since 4s+1Rs>2s+2+4/3, it gives ρ<Rs. Thus the completed support Ds∪{s+1,s+2,…} has value greater than 1/2. It does not prove that every later greedy step survives. For s≥13, under the additional all-right-tail hypothesis, the same completed support would have value less than 1/2, giving the contradiction in finalMiddleCell_neg_three_not_last. That tail hypothesis must not be dropped. For c=2,3, the displayed upper bound alone no longer gives ρ<Rs.

A parallel equivalence holds for the right branch: an overshoot witness ≤2s produces a pulse leak above 2s+2 exactly when the overshoot lies within an explicit distance k of 2s with 4k<abovePulse (seamRightPulseLeak_iff_distanceCell). The remainder left by the integer greedy rule with the row-s quotient weights and target 22s−1 (seamPureHalfPrefixRemainder) has an exact case-split formula (seamPureHalfPrefixRemainder_eq_ite), and a bound on it is proved equivalent to the two-sided bound (seamPureHalfPrefixRemainder_le_iff_twoSided).

Observation 6.141 (The reset-band hypothesis has a verified base case). The upper-reset dyadic-band escape condition (discussed after Section 12.5) is reduced by three lemmas to a quarter-scale overshoot exclusion: an equivalence (seamUpperReset_band_iff_successorRemainder_avoids) rewrites the reset-charge band as a successor-remainder avoidance; an identity (upperResetCharge_dyadicDistance_add_abovePulse) rescales it by a factor of 4; and a third lemma (seamUpperReset_band_of_overshoot_band) derives the band from a quarter-scale overshoot exclusion plus the pulse bound abovePulse≤2(d−2). Row d=13, the first row of the late regime, is then proved unconditionally to escape every band simultaneously: its successor remainder is exactly 392, by exact computation (seamUpperResetDyadicBandEscape_at_thirteen). This is one verified row of a hypothesis required for every d≥13; it shows only that the base case is not itself an obstruction.

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.