Ordering of nested square roots of 2 according to Gray code
Pierluigi Vellucci, Alberto Maria Bersani

TL;DR
This paper explores the relationship between zeros of Lucas-Lehmer polynomials, nested square roots of 2, and Gray code, establishing an ordering based on binary coding of signs in the nested structure.
Contribution
It introduces a novel method linking Gray code to the ordering of zeros of Lucas-Lehmer polynomials expressed as nested square roots of 2.
Findings
Established a correspondence between Gray code and zeros of Lucas-Lehmer polynomials.
Provided an ordering scheme for the zeros based on binary coding.
Enhanced understanding of the structure of nested square roots of 2.
Abstract
In this paper we discuss some relations between zeros of Lucas-Lehmer polynomials and Gray code. We study nested square roots of 2 applying a "binary code" that associates bits and to and signs in the nested form. This gives the possibility to obtain an ordering for the zeros of Lucas-Lehmer polynomials, which assume the form of nested square roots of 2.
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.
