Ordering of nested square roots of 2 according to the Gray code (Q1696813)

It is well known that the Lucas-Lehmer polynomials are determined by the recurrence formula \[ L_0(x)=x; \; L_n(x)=L_{n-1}^2(x)-2, \quad n \geq 1, \] and the roots of \(L_n(x)\) have the form \[ \pm \sqrt{2\pm\sqrt{2\pm \sqrt{2\pm \sqrt{2\pm \dots \pm 2 }}}}. \] For each \(n \geq 1\), we have \[ L_n(x)=2 T_{2^{n-1}}\Big(\frac{x^2}{2}-1\Big), \] where \(T_n(x)\) are the Chebyshev polynomials of the first kind. The Gray code is a binary code of order \(n\) and length \(2^n\). Nested square roots of \(2\) applying a ``binary code'' that associates bits \(0\) and \(1\) to ``plus'' and ``minus'' signs in the nested form are studied. Theorem. The string with which we code the \(2^{n-1}\) positive zeros of \(L_n(x)\) (sorted in decreasing order) follows the sorting of the Gray code.