English

$\pi$-formulas and Gray code

Number Theory 2018-10-04 v6

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 LnL_n. In this paper, the zeros, expressed in terms of nested radicals, are used to obtain two formulas for π\pi: the first can be seen as a generalization of the known formula π=limn2n+122+2+2+...+2n ,\pi=\lim_{n\rightarrow \infty} 2^{n+1}\cdot \sqrt{2-\underbrace{\sqrt{2+\sqrt{2+\sqrt{2+...+\sqrt{2}}}}}_{n}} \ , related to the smallest positive zero of LnL_n; the second is an exact formula for π\pi achieved thanks to some identities valid for LnL_n.

Keywords

Cite

@article{arxiv.1606.09597,
  title  = {$\pi$-formulas and Gray code},
  author = {Pierluigi Vellucci and Alberto Maria Bersani},
  journal= {arXiv preprint arXiv:1606.09597},
  year   = {2018}
}
R2 v1 2026-06-22T14:39:54.711Z