Related papers: Three essays on Machin's type formulas
In this paper we propose a new method for determination of the two-term Machin-like formula for pi with arbitrarily small arguments of the arctangent function. This approach excludes irrational numbers in computation and leads to a…
We present a simple recurrent formula to generate the Machin-like expression for calculating $\pi/4$. The method works for any denominator in the starting term and always provides a finite decomposition. We show that the terms in the…
In our recent publication we have proposed a new methodology for determination of the two-term Machin-like formula for pi with small arguments of the arctangent function of kind $$ \frac{\pi }{4} = {2^{k - 1}}\arctan \left(…
In this work, we consider the properties of the two-term Machin-like formula and develop an algorithm for computing digits of $\pi$ by using its rational approximation. In this approximation, both terms are constructed by using a…
Previously we have proposed a new method of transforming quotients into integer reciprocals in the Machin-like formulas for $\pi$. As a further development, here we show how to generate a multi-term Machin-like formula for $\pi$ with a…
Lehmer defined a measure $$ \mu=\sum\limits_{j=1}^J\frac{1}{\log_{10}\left(\left|\beta_j\right|\right)}, $$ where the $\beta_j$ may be either integers or rational numbers in a Machin-like formula for $\pi$. When the $\beta_j$ are integers,…
We present a new form of the Machin-like formula for $\pi$ that can be generated by using iteration. This form of the Machin-like formula may be promising for computation of the constant $\pi$ due to rapidly increasing integers at each step…
In this paper we present a two-term Machin-like formula for pi \[\frac{\pi}{4} = 2^{k - 1}\arctan\left(\frac{1}{u_1}\right) + \arctan\left(\frac{1}{u_2}\right)\] with small Lehmer's measure $e \approx 0.245319$ and describe iteration…
We shall show that there exist only finitely many nondegenerate three-term Machin-type formulae and give explicit upper bounds for the sizes of variables.
We construct closed forms that generate with repetitions all Mersenne primes, respectively all Fermat primes, all twin-prime pairs and all Sophie Germain primes. Also, we construct closed forms that count all Mersenne primes between $0$ and…
We develop a refinement process for two-term Machin-like formulas: $a_0 \arctan{u_0} + a_1 \arctan{u_1} = \frac{\pi}{4}$ (where $a_0 , a_1 \in \mathbb{Z}$, $u_0 , u_1 \in \mathbb{Q}_+^*$, $u_0 > u_1$) by exploiting the continued fraction…
In our earlier publication we have shown how to compute by iteration a rational number ${u_{2,k}}$ in the two-term Machin-like formula for pi of kind…
The article shows how two choices are possible whenever computing the geometric mean, and the repetition of this process can in general yield 2-to-the power N different values when the choices are compounded in the first N steps of…
We derive interesting arctangent identities involving the golden ratio, Fibonacci numbers and Lucas numbers. Binary BBP-type formulas for the arctangents of certain odd powers of the golden ratio are also derived, for the first time in the…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct…
We count with a smooth weight the number of $2 \times 2$ integer matrices with a fixed characteristic polynomial with a main term and an error term using bounds for sums of Weyl sums for quadratic roots.
Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
We explore the possibility of using machine learning to identify interesting mathematical structures by using certain quantities that serve as fingerprints. In particular, we extract features from integer sequences using two empirical laws:…