Three essays on Machin's type formulas
Armengol Gasull, Florian Luca, Juan L. Varona

TL;DR
This paper investigates Machin's type formulas, providing a complete classification of two-term formulas with specific properties, a method to generate infinitely many formulas, and corrections to previous results involving the golden section.
Contribution
It offers a comprehensive classification of two-term Machin formulas with 2-integer arctangents, introduces a method to find infinitely many formulas, and corrects earlier oversights involving the golden section.
Findings
All two-term Machin formulas with 2-integer arctangent functions are characterized.
A method to generate infinitely many Machin formulas with N terms is developed.
All two-term formulas involving arctangents of powers of the golden section are identified.
Abstract
We study three questions related to Machin's type formulas. The first one gives all two terms Machin formulas where both arctangent functions are evaluated -integers, that is values of the form for some integers and~. These formulas are computationally useful because multiplication or division by a power of two is a very fast operation for most computers. The second one presents a method for finding infinitely many formulas with terms. In the particular case the method is quite useful. It recovers most known formulas, gives some new ones, and allows to prove in an easy way that there are two terms Machin formulas with Lehmer measure as small as desired. Finally, we correct an oversight from previous result and give all Machin's type formulas with two terms involving arctangents of powers of the golden section.
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.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Mathematical Theories and Applications · Computability, Logic, AI Algorithms
