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
Further restrictions on represented values

These results concern achievement-set geometry and do not settle the universal irrationality problem. For an arbitrary support restriction J⊆N, let AJ be the set of Mersenne digit values supported on J (supportedMersenneAchievementSet). It is compact (isCompact_supportedMersenneAchievementSet), nowhere dense for every J (isNowhereDense_supportedMersenneAchievementSet), and perfect, that is compact with no isolated points, whenever J is infinite (perfect_supportedMersenneAchievementSet), via a Cantor-space no-isolated-point argument on the coding space itself (preperfect_supportedMersenneDigitSet).

Proposition 6.146 (Exact Lebesgue-measure dichotomy). Either J=Fc for a finite F, and vol(AJ)=2−|F| exactly, or Jc is infinite and the volume is exactly 0.

The finite case is an exact doubling induction over inserted coordinates (volume_supportedMersenneAchievementSet_insert), using disjointness of the two coordinate-split faces (disjoint_supportedMersenneAchievementSet_translate); this is where unique binary coding is used. The dichotomy is the case of retained coordinates of Hornich’s strict-tail measure formula [4]: the retained Mersenne weights still exceed their tails, and the Mersenne tail estimate supplies the values 2−|F| and 0. None of this concerns irrationality of any subseries value.

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.