We give algorithms for the calculation of pi. These algorithms can be easily developed in a linear manner and allows the calculation of pi with an infinite degree of convergence. Of course, the calculation of the second term passes through the first one, and it is necessary, as this type of algorithms, for a larger memory for calculations contrary to the formula BBP  whose execution corresponds to the order of the desired number. The advantage of our formulas in spite of the dificulty associated with extracting sin(x) lies in their degree of convergence, which is infinite, they prove the Borweins brothers hypothesis on the construction of algorithms At any speed as symbolized in our generic formula (8) of this paper. These formulas for the most part are totally new : We had found several other formulas of pi l
Comments: 7 Pages. algorithm, convergence and approximation
[v1] 2017-04-15 06:48:55
Unique-IP document downloads: 16 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.