Related papers: BBP-type formulas -- an elementary approach

The quantum search algorithm consists of an alternating sequence of selective inversions and diffusion type operations, as a result of which it can find a target state in an unsorted database of size N in only sqrt(N) queries. This paper…

We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…

We introduce several spt-type functions that arise from Bailey pairs. We prove simple Ramanujan type congruences for these functions which can be explained by a spt-crank-type function. The spt-crank-type functions are constructed by adding…

In this paper, we establish a theorem of Bombieri -- Vinogradov type for exponential sums over Piatetski-Shapiro primes $p= [n^{1/\gamma}]$ with $\frac{865}{886}<\gamma < 1$.

We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination. We show that all the structural rules in our…

We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…

New differential-recurrence relations for B-spline basis functions are given. Using these relations, a recursive method for finding the Bernstein-B\'{e}zier coefficients of B-spline basis functions over a single knot span is proposed. The…

A generalised summation method is considered based on the Fourier series of periodic distributions. It is shown that $$ e^{it}-2e^{2it}+3e^{3it}-4e^{4it}+-\cdots = {\mathrm P\mathrm f} {\displaystyle \frac{e^{it}}{(1+e^{it})^2}} +i\pi…

This paper explores closed-form expressions for some polylogarithm integrals with integrands containing five parameters. These closed form expressions are given in terms of the Lerch transcendent function, which reduces, in some cases, to…

In this work, we prove the irrationality of $\pi$ based on the nested radicals with roots of $2$ of kind $c_k = \sqrt{2 + c_{k - 1}}$ and $c_0 = 0$. Sample computations showing how the rational approximation tends to $\pi$ with increasing…

In this work, we consider the singular integrals of Cauchy type of the forms $$\ds J(f,x)= \frac{\sqrt{1-x^2}}{\pi}\int_{-1}^1\frac{f(t)}{\sqrt{1-t^2}(t-x)}\,dt, -1<x<1 and $$\ds \Phi(f,z)=…

The Stirling approximation formula for $n!$ dates from 1730. Here we give new and instructive proofs of this and related approximation formulae via tools of probability and statistics. There are connections to the Central Limit Theorem and…

The purpose of this article is to present, in a simple way, an analytic approach to special numbers and polynomials. The approach is based on the derivative polynomials. The paper is, to some extent, a review article, although it contains…

Versions of Bailey's lemma which change the base from q to q^2 or q^3 are given. Iterates of these versions give many new versions of multisum Rogers-Ramanujan identities. We also prove Melzer's conjectures for the Fermionic forms of the…

Galperin introduced an interesting method to learn the digits of $\pi $ by counting the collisions of two billiard balls and a hard wall. This paper studies two quantum versions of the Galperin billiards. It is shown that the digits of $\pi…

Using techniques from calculus, we combine classical identities for $\pi$, $\operatorname{ln}2$, and harmonic numbers, to arrive at a nice infinite series formula for $\pi/3$ that does not appear to be well known. In addition, we give…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

This paper consists of three independent parts: First we use only elementary algebra to prove that the quartic algorithm of the Borwein brothers has exactly the same output as the Brent-Salamin algorithm, but that the latter needs twice as…

In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…