In our earlier publication we have shown how to compute by iteration a rational number u2,k in the two-term Machin-like formula for π of the kind π4=2k−1arctan1u1,k+arctan1u2,k,k∈Z,k≥1, where u1,k can be chosen as an integer u1,k=ak/2−ak−1 with nested radicals defined as ak=2+ak−1 and a0=0. In this work, we report an alternative method for determination of the integer u1,k. This approach is based on a simple iteration and does not require any irrational (surd) numbers from the set ak in computation of the integer u1,k. Mathematica programs validating these results are presented
We show that all perfect odd integer squares not divisible by 3, can be usefully written as N = a + ...
Abstract. We give a more practical variant of Shanks ’ 1954 algorithm for computing the continued fr...
AbstractCurrent computer algebra systems use the quotient-remainder algorithm for division of long i...
The file 'u2.txt' contains the computed value of the rational number u2 at k = 27 and u1 = 85445659 ...
In this paper we present a two-term Machin-like formula for pi \[\frac{\pi}{4} = 2^{k - 1}\arctan\le...
A fundamental problem in numerical computation and computational geometry is to determine the sign o...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
AbstractAn efficient algorithm is presented for reconstructing a rational number from its residue mo...
In many applications of real-number computation we need to evaluate elementary functions such as exp...
In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for comput...
Constants with formulae of the form treated by D. Bailey, P. Borwein, and S. Plouffe (BBP formulae t...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
Abstract: By using Hermite-Pade approximates for the system of Markov functions are consis...
AbstractLet α be a positive irrational real number, and let Cα(n) = ∑1 ≤ k ≤ n ({kα} − 12), n ≥ 1, w...
We show that all perfect odd integer squares not divisible by 3, can be usefully written as N = a + ...
Abstract. We give a more practical variant of Shanks ’ 1954 algorithm for computing the continued fr...
AbstractCurrent computer algebra systems use the quotient-remainder algorithm for division of long i...
The file 'u2.txt' contains the computed value of the rational number u2 at k = 27 and u1 = 85445659 ...
In this paper we present a two-term Machin-like formula for pi \[\frac{\pi}{4} = 2^{k - 1}\arctan\le...
A fundamental problem in numerical computation and computational geometry is to determine the sign o...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
AbstractAn efficient algorithm is presented for reconstructing a rational number from its residue mo...
In many applications of real-number computation we need to evaluate elementary functions such as exp...
In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for comput...
Constants with formulae of the form treated by D. Bailey, P. Borwein, and S. Plouffe (BBP formulae t...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
Abstract: By using Hermite-Pade approximates for the system of Markov functions are consis...
AbstractLet α be a positive irrational real number, and let Cα(n) = ∑1 ≤ k ≤ n ({kα} − 12), n ≥ 1, w...
We show that all perfect odd integer squares not divisible by 3, can be usefully written as N = a + ...
Abstract. We give a more practical variant of Shanks ’ 1954 algorithm for computing the continued fr...
AbstractCurrent computer algebra systems use the quotient-remainder algorithm for division of long i...