$\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 . 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 .
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}
}