Related papers: A Rapidly Converging Machin-like Formula for $\pi$
By employing certain extended classical summation theorems, several surprising \pi and other formulae are displayed.
A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.
In this paper, we introduce a new iteration method and show that this iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that the new iteration method is equivalent to both Mann…
We present an improved version of the analytic method for calculating $\pi(x)$, the number of prime numbers not exceeding $x$. We implemented this method in cooperation with J. Franke, T. Kleinjung and A. Jost and calculated the value…
This is a short note in which we show how to calculate the value of Perelman's nu-functional for a variety of metrics. In particular we complete the calculation of values for the known 4-dimensional Einstein and shrinking Ricci soliton…
In 1996, Ricardo Ricardo Ma\~n\'e discovered that Mather measures are in fact the minimizers of a "universal" infinite dimensional linear programming problem. This fundamental result has many applications, one of the most important is to…
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
In this paper we consider approximations of Neumann problems for the integral fractional Laplacian by continuous, piecewise linear finite elements. We analyze the weak formulation of such problems, including their well-posedness and…
We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…
In terms of the hypergeometric method, we give the extensions of two known series for $\pi$. Further, other twenty-nine summation formulas for $\pi$, $\pi^2$ and $1/\pi$ with free parameters are also derived in the same way.
By a Cantor-like measure we mean the unique self-similar probability measure $\mu $ satisfying $\mu =\sum_{i=0}^{m-1}p_{i}\mu \circ S_{i}^{-1}$ where $% S_{i}(x)=\frac{x}{d}+\frac{i}{d}\cdot \frac{d-1}{m-1}$ for integers $2\leq d<m\le 2d-1$…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
The paper introduces a method of partial fractions with matrix coefficients and its applications to finding chains of generalized eigenvectors, to evaluation of matrix exponentials, and to solution of linear systems of ordinary differential…
In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…
This paper presents a family of rapidly convergent summation formulas for various finite sums of analytic functions. These summation formulas are obtained by applying a series acceleration transformation involving Stirling numbers of the…
We give a recursive formula for the Moebius function of an interval $[\sigma,\pi]$ in the poset of permutations ordered by pattern containment in the case where $\pi$ is a decomposable permutation, that is, consists of two blocks where the…
In this work, we consider a rational approximation of the exponential function to design an algorithm for computing matrix exponential in the Hermitian case. Using partial fraction decomposition, we obtain a parallelizable method, where the…