Related papers: Easy Proofs of Some Borwein Algorithms for $\pi$
In 1981, Adriano Garsia and Steve Milne found the first bijective proof of the celebrated Rogers-Ramanujan identities. To achieve this feat, they invented a versatile tool that they called the Involution Principle. In this note we revisit…
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…
In this article using the theory of Eisenstein series, we give rise to the complete evaluation of two Gauss hypergeometric functions. Moreover we evaluate the modulus of each of these functions and the values of the functions in terms of…
The main goal of the paper is to introduce methods which compute B\'ezier curves faster than Casteljau's method does. These methods are based on the spectral factorization of a $n\times n$ Bernstein matrix, $B^e_n(s)= P_nG_n(s)P_n^{-1}$,…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
Guo and Zudilin [Adv. Math. 346 (2019), 329--358] introduced a new method called `creative microscoping', to prove many $q$-supercongruences in a unified way. In this paper, we apply this method and Watson's ${}_8\phi_7$ transformation…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
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 consider concave minimization problems over non-convex sets.Optimization problems with this structure arise in sparse principal component analysis. We analyze both a gradient projection algorithm and an approximate Newton algorithm where…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
Re presenting the traditional proof of Srinivasa Ramanujan's own favorite series for the reciprocal of $\pi$ :\begin{equation}\frac{1}{\pi} = \frac{\sqrt{8}}{9801} \sum_{n=0}^{+\infty} \frac{(4n)!}{(n!)^4} \frac{1103 + 26390n}{396^{4n}} \;…
"Divergent" Ramanujan-type series for $1/\pi$ and $1/\pi^2$ provide us with new nice examples of supercongruences of the same kind as those related to the convergent cases. In this paper we manage to prove three of the supercongruences by…
A Ramanujan-type series satisfies $$ \frac{1}{\pi} = \sum_{n=0}^{\infty} \frac{\left( \frac{1}{2} \right)_{n} \left( \frac{1}{s} \right)_{n} \left(1 - \frac{1}{s} \right)_{n} }{ \left( 1 \right)_{n}^{3} } z^{n} (a + b n), $$ where $s \in \{…
The constant $\pi$ has fascinated scholars throughout the centuries, inspiring numerous formulas for its evaluation, such as infinite sums and continued fractions. Despite their individual significance, many of the underlying connections…
Borwein, Bailey, and Girgensohn (2004) asked whether the following infinite series converges: the sum of $(\frac{2}{3} + \frac{1}{3} \sin n)^n / n$ over all positive integers $n$. We prove that their series converges. The proof uses the…
Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…
Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have…
Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm.
Newton, in notes that he would rather not have seen published, described a process for solving simultaneous equations that later authors applied specifically to linear equations. This method that Euler did not recommend, that Legendre…