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

Reciprocal-summable supports

For every infinite set A of positive integers with ∑a∈A1/a<∞, the series

XA(b)=∑a∈A1ba−1

is irrational at every integer base b≥2. This is the reciprocal-summable theorem also stated in the short paper’s Appendix A. Erdős’s 1968 paper, p. 222 proves the pairwise-coprime case at every integer base and states the removal of coprimality without printing the details. The proof below gives the stated extension by averaging; no comparison with the omitted proof is possible. The pairwise-coprime case, Theorem 6.15, retains that extra hypothesis. The same paper says that ∑1/ni<∞ could be replaced by a weaker but more complicated condition (p. 222), and suggests that for pairwise coprime supports Brun’s method could probably replace it by ∑ni<x1/ni=o(log⁡log⁡x) (p. 226). Theorem 1.1 below proves irrationality under one explicit weaker condition without coprimality; no identification with his suggestions is asserted.

We show that rationality would impose a positive lower bound and then construct smaller values. For a positive integer N, write N=qaa+ra, 0≤ra<a. The identity

bN−1ba−1=bra∑j=0qa−1bja+bra−1ba−1

shows that

Δb,A(N):=∑a∈AbNmoda−1ba−1=(bN−1)XA(b)−JN,JN∈Z.

The integer sum is finite, since qa=0 for a>N. Every summand of Δb,A(N) is nonnegative and an exponent a>N makes it positive. Thus XA(b)=p/q would imply Δb,A(N)≥1/q for every N>0.

Put wb,d(N)=bNmodd/(bd−1). For a fixed positive modulus Q and g=(Q,d), the orbit of Qmmodd has length d/g. Its geometric sum gives

limX→∞1X∑m=1Xwb,d(Qm)=MQ,b(d):=gd(bg−1)≤1d.

To interchange this limit with the sum over the support, expand wb,d(Qm) as ∑r≥1b−r1d∣Qm+r. Counting positive multiples of d then gives

1X∑m=1Xwb,d(Qm)≤∑r≥1b−rQ+rd≤Q+2d.

With Q fixed, dominated convergence identifies the limiting mean of ∑d∈Awb,d(Qm) with ∑d∈AMQ,b(d).

Now choose Qt=lcm⁡(1,…,t). For each fixed d, eventually d∣Qt, so MQt,b(d)=(bd−1)−1. The bound MQt,b(d)≤1/d permits a second dominated-convergence argument:

∑d∈AMQt,b(d)⟶XA(b).

Consequently the limiting mean of Δb,A(Qtm) tends to zero. Given ε>0, first choose t and then a sufficiently long finite average with mean below ε; one term of that average is below ε. Under rationality, choosing ε<1/q contradicts the lower bound above. This proves the assertion. The exact all-base statement, with hypotheses b≥2, infinitude of A, and summability of a↦1A(a)/a, has a kernel-checked Lean proof.

We increased the observation length with Qt fixed, and only then increased t; no independence of divisibility events was used. At base two and full support, the contribution of exponents a>N alone gives Δ2,N>0(N)>1−2−N≥1/2. Full-support irrationality therefore uses a different argument; see Theorem 5.4.

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.