Plectis

Cross-problem paper

Reading Eight Erdős Problems Together

Eight Erdős problems read together By 22 September 2026 Authorship, AI use and citation

Précis. One account of the mathematics developed across the programmes: an exact tail-capacity criterion under eventual congruences, its sharp factorial support-gap threshold, rational and irrational Lambert subsums across bases, and the limits of finite greedy tests and other irrationality methods. Full arguments, exact counterexamples, unsuccessful routes and attribution are retained together. The principal proofs are ordinary mathematics; cited Lean ingredients have their own stated scope. Historical novelty and independent expert review are not established.

This paper owns the synthesis exposition and ordinary proofs across the covered problems: capacity and congruence constructions, Lambert subsums, rational-point counts, method limits and their research record.

It is not authority for a solution to any original Erdős target, historical novelty, independent expert review, or a full Lean proof of the analytic capacity criterion or Lambert-chain theorem.

In this paper

The computation and its limits

The computation [36] runs the greedy rule in exact arithmetic on every reduced fraction in (0,E] with 2≤q≤Q.

First reading. At Q=36, 382 of 633 fractions are not rejected through step 160 and 14 are finite subsums, a share (382+14)/633=0.6256 close to 1/E=0.6224. This was read as evidence that about 62% of rationals are subsums, hence that #257 is false. The reading is wrong. By Theorem 6.4 above the share at any fixed depth tends to 2NRN/E whatever the truth of #257, because fractions equidistribute over the 2N intervals that survive N steps.

An incorrect stopping rule. A subsequent interpretation went too far in the opposite direction, asserting that survival after about 2log2⁡Q−3.3 steps was forced. The measure-based main term for the number rejected at step n is 2n−1gn∑2≤q≤Qφ(q), asymptotically (3Q2/π2)2n−1gn, which is below 1 for n>2log2⁡Q−2log2⁡π, about step 12 at Q=200. A main term below 1 does not make the actual count zero. Theorem 6.4 is a fixed-depth asymptotic, and its error O(2Nlog⁡Q/Q) does not justify an extrapolation to N∼2log2⁡Q. Late rejections remain exact nonmembership certificates; the 12,218 fractions not rejected through step 60 have only that finite-depth status. At N=12 the observed share is 0.62372 against 212R12/E=0.62245.

An exact rejection at step 17. The witness 189/388, recorded in the earlier investigation’s Desk B report, contradicts the proposed stopping rule: 2log2⁡388−2log2⁡π is about 13.9. The selected indices through step 16 are F={2,3,7,9,10,14,15,16}. At each skipped earlier index n, exact rational arithmetic gives a remainder at most 2−n<Rn, so no rejection has yet occurred. The remaining value is

r=189388−XF=92918226006891217890317075045460.

Since 1/(2k−1)=2−k+4−k/(1−2−k) and 1/(1−2−k)≤2 for k≥1, summing gives

Rn≤2−n+23⋅4n.

At n=17, the exact comparison is

R17≤19660925769803776<r<1131071=w17.

The same rejection occurs for 577/388=1+189/388 by Lemma 6.9. The independent reproduction, including every earlier skipped step, is in research/experiments/sparse_interpolation/late_rejection.py. This certificate shows that deeper computation can add exclusions. It does not convert survival to any finite depth into a membership certificate.

What survives is the agreement itself. At Q=200 the counts at steps 1 to 9 are 4809, 1470, 600, 268, 132, 66, 32, 8, 6, against 4811, 1467, 604, 277, 133, 65, 32, 16, 8 from the measures of Lemma 6.8; steps 10 and 11 have none against 4 and 2, and step 12 has 4 against 1. The late counts fluctuate more than independent events would, because rejections arrive in the families of Lemma 6.9.

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 at sha256:83e0788b73c2144a. It matched the published source manifest, 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.