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

Traces in the cubic field

We now need the square relation to constrain the coefficient η. Factoring it produces reciprocal elements, avoiding a separate expansion of the square root in a basis of K:

(α+β)(α−β)=1.

Put z=α+β. Then z−1=α−β and 2α=z+z−1. Since z∈K and α∈Q(z), we have Q(z)=K. Write the minimal polynomial of z as

p(T)=T3+bT2+dT+w,b,d,w∈Q,w≠0.

The minimal polynomial of z−1 is the monic reciprocal polynomial

T3p(T−1)w=T3+dwT2+bwT+1w.

We compute the same three traces from f and from the reciprocal pair z,z−1. All traces are from K to Q. The cubic for α gives:

Tr⁡(α)=0,Tr⁡(α2)=2,Tr⁡(α3)=−3η.

Newton’s identities for p and its reciprocal give

(8)d=−bw,b2+b(w−w−1)=1,η=(b2+1)(w+w−1)8.

For completeness, the first equality follows from 0=2Tr⁡(α)=−b−d/w. After substituting d=−bw, Newton’s identities give

Tr⁡(z2)+Tr⁡(z−2)=2b2+2b(w−w−1),Tr⁡(z3)+Tr⁡(z−3)=−3(b2+1)(w+w−1).

The first line is 4Tr⁡(α2)−6=2. The second is 8Tr⁡(α3)=−24η, because the mixed terms in (z+z−1)3 have trace 3Tr⁡(z+z−1)=0. These give the other two equalities in (8).

Multiplying the middle equation by w and bringing all terms to one side gives (bw−1)(b+w)=0. Write w=r/s in lowest terms, with r≠0, s>0. Substituting b=−w or b=1/w into the last equation and using η=6c/m gives respectively

m=48crs3(r2+s2)2orm=48cr3s(r2+s2)2.

Here the integer scale m is decisive: coprimality gcd(r2+s2,rs)=1 prevents cancellation with the variable factors in either numerator, so (r2+s2)2 divides 48. Hence r2+s2 is 1, 2 or 4. Both r and s are nonzero, which leaves only 2: a sum of two nonzero integer squares cannot equal 1 or 4. Thus |r|=s=1, and positivity of m gives m=12. The only remaining numerators are

Q(n)=2n(n+1)(n+2)+1andQ(n)=2n(n+1)(n+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.