Plectis

Short paper

Reciprocal Sums and the Sylvester Recurrence

Summary. For strictly increasing positive integers with an2/an+1=1+3/n+o(n−3), the reciprocal sum is irrational. The argument extracts a cubic polynomial from an integer tail numerator, restricts its coefficients using a square in a cubic field, and excludes the remaining cases modulo seven. Under rationality and the quadratic growth limit, separate criteria using bounded numerator increases and weighted first crossings force the eventual Sylvester recurrence. The unrestricted Erdős–Graham question remains open.

This paper covers cubic-rate irrationality, nonintegral regular-rate exclusion and sufficient tail criteria for the Sylvester recurrence; the unrestricted Erdős–Graham question remains open.

It does not establish the validity of claims tagged Lean, which belongs to the cited kernel-checked source, or a solution to Erdős #243, which remains open.

In this paper

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:b393a9190d51137f. 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.