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
Equivalent carry conditions at perfect-square depths
The statement needed

The following five conditions are equivalent to 1/2∈A:

  1. CG(N)≤2N+4 for every N≥0.

  2. The set N>0∖G is infinite.

  3. For arbitrarily large n there is D⊆{2,…,n} with Q(D,n)=2n−1−1.

  4. For arbitrarily large M, ihc⁡(G,M)≤B(M+1).

  5. For arbitrarily large M≥1 there is D⊆{2,…,M} with |ihc⁡(D,M−1)|≤B(M).

Here G is the actual greedy support for 1/2. The forward directions of (2)–(5) are proved in Lean (half_mem_mersenneAchievementSet_of_positiveHalfGreedySkips, half_mem_mersenneAchievementSet_of_cofinalExactLocalRows, half_mem_mersenneAchievementSet_of_cofinalStripReturn, half_mem_mersenneAchievementSet_of_cofinalTerminalOnlyStrip). The reverse implications are ordinary deductions in this paper. The perfect-square argument below supplies the terminal bounds without changing the constant in the original statements.

The carry bound at perfect-square depths

Lemma 11.3 (The terminal bound at square depths). Let A⊆N with 1∉A and XA(2)=1/2. Then for every k≥1,

(ihc⁡ A (k2−1) : R) = binaryCoeffTail (cA) (k2) ≤ 2k+4 = B (k2).

Proof. By integerHalfCarry_eq_scaled_residual_add_tail,

(ihc⁡ A N:R)=2N+1(12−XA(2))+∑j≥1cA(N+1+j)2−j,

and the first term vanishes by hypothesis. Take N=k2−1, so N+1=k2. By binaryCoeffTail_supportCoeff_le_two_sqrt_add_four (unconditional) the tail at k2 is at most 2k2+4=2k+4, and by halfStripBound, B n=2⌊n⌋+4, which at n=k2 equals 2k+4 exactly. Non-negativity of the tail (binaryCoeffTail_nonneg) gives the lower side. ◻

The difference between the real and the integer square root disappears when cofinal witness depths are restricted to perfect squares: at n=k2 the two roots coincide exactly and no widening is needed. Applying Lemma 11.3 along M=k2−1 gives (4) directly; taking a to be the indicator of an achieving support truncated to {0,…,M} at M=k2, and using integerHalfCarry_inter_Iic_eq_of_succ_le together with 1∉A (forced because w1=1>1/2), gives the witness required by HalfTerminalOnlyStripWitness and hence (5).

What the equivalences establish

Each biconditional is a theorem about the exact logical content of a proposed hypothesis. It is also a reformulation of the membership question. These are compatible descriptions, not competing evidence classes. The equivalence identifies the missing content but does not show that the reformulation cannot expose a useful invariant. In particular, (3) shows that the existence of finite witnesses at unbounded depths, even without compatibility between those witnesses, is equivalent to membership. The absence of a compatibility requirement may still be useful in constructing witnesses; equivalence alone says nothing about which formulation is easier to prove.

Scope of the equivalences. (1) does not extend to every A with 1∉A: without erdosSupportSeries_greedyMersenneSupport_le (which supplies δ:=1/2−SG≥0 for the greedy support specifically) one obtains only the one-sided equivalence of the bound in (1), with A in place of G, and 1/2−SA≤0. The mechanism in all five cases is the same and should be recorded once: 2N+1δ dominates any N envelope, so a strip hypothesis forces δ=0; and δ=0 makes the unconditional tail bound supply the strip. Membership is then read off by mem_mersenneAchievementSet_iff_greedy_survival.

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.