$\pi$-formulas and Gray code
Pierluigi Vellucci, Alberto Maria Bersani

TL;DR
This paper explores the zeros of a class of polynomials related to Lucas-Lehmer numbers, revealing their distribution follows Gray code sequences and deriving new formulas for calculating π using these zeros.
Contribution
It introduces new formulas for π based on the zeros of polynomials related to Lucas-Lehmer numbers and their connection to Gray code sequences.
Findings
Zeros of the polynomials are expressed in nested radicals.
Derived two new formulas for π involving these zeros.
Established a link between polynomial zeros distribution and Gray code.
Abstract
In previous papers we introduced a class of polynomials which follow the same recursive formula as the Lucas-Lehmer numbers, studying the distribution of their zeros and remarking that this distribution follows a sequence related to the binary Gray code. It allowed us to give an order for all the zeros of every polynomial . In this paper, the zeros, expressed in terms of nested radicals, are used to obtain two formulas for : the first can be seen as a generalization of the known formula related to the smallest positive zero of ; the second is an exact formula for achieved thanks to some identities valid for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
