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

A square forced by a zero numerator

At a zero of the numerator polynomial modulo a prime, the recurrence must still relate the two neighbouring nonzero numerators. Eliminating vn from two exact updates makes this constraint visible:

(6)un+2=(an+an+1)un+1−an2un.

Whenever uk≡0(modℓ), it follows that

−uk−1uk+1≡(ak−1uk−1)2(modℓ).

Thus the negative product of the neighbouring numerators must be a square. Since our numerator is a polynomial, its roots modulo ℓ tell us exactly where to apply this observation.

Let ℓ∤6m be prime and let r∈Fℓ satisfy f(r)=0. The constant η=6c/m is nonzero modulo ℓ, so r∉{0,1,−1}. Choose a sufficiently late k with k+1≡r(modℓ). Then uk=κf(k+1)≡0, whereas

f(r−1)=−3r(r−1),f(r+1)=3r(r+1).

Consequently, in Fℓ,

(ak−1uk−1)2=−uk−1uk+1=9κ2r2(r2−1).

Dividing by the nonzero square 9κ2r2 gives

(7)ℓ∤6m,r∈Fℓ,f(r)=0⟹r2−1∈(Fℓ×)2(ℓ prime).

The condition holds for every root; primes with no root impose no condition. This quantifier matters in passing to a number field.

Let α be a root of f and put K=Q(α), a cubic field. Suppose α2−1 is a nonsquare in K, and choose β with β2=α2−1. To contradict the modular condition, we seek a Frobenius that fixes α but exchanges β and −β. The nontrivial automorphism of K(β)/K does exactly this. Extend it to σ∈Gal⁡(M/Q), where M is a Galois closure of K(β)/Q.

Chebotarev’s density theorem [9] supplies infinitely many unramified rational primes with Frobenius conjugate to σ; choosing a prime of M above each makes it equal to σ. Omit residue characteristic two, primes dividing 6m, and the finitely many primes where α or β is nonintegral or β reduces to zero. Frobenius acts by the ℓ-th power on the residue field, so

α¯ℓ=α¯,β¯ℓ=−β¯≠β¯.

Thus r=α¯ lies in Fℓ and satisfies f(r)=0, but neither root ±β¯ of X2−(r2−1) lies in that field. The condition for every root in (7) applies to this r, giving the contradiction. Hence some β∈K satisfies β2=α2−1.

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.