Short paper
Reciprocal Sums and the Sylvester Recurrence
Summary. For strictly increasing positive integers with
Start here, by the editorial route
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
Whenever
Thus the negative product of the neighbouring numerators must be a
square. Since our numerator is a polynomial, its roots modulo
Let
Consequently, in
Dividing by the nonzero square
The condition holds for every root; primes with no root impose no condition. This quantifier matters in passing to a number field.
Let
Chebotarev’s density theorem [9] supplies infinitely many
unramified rational primes with Frobenius conjugate to
Thus
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.