Related papers: A BBP-style computation for $\pi$ in base 5
In this work, we obtain an iterative formula that can be used for computing digits of $\pi$ and nested radicals of kind $c_n/\sqrt{2 - c_{n - 1}}$, where $c_0 = 0$ and $c_n = \sqrt{2 + c_{n - 1}}$. We also show how with the help of this…
A method of obtaining the number pi is considered, which derives pi from the number of elastic collisions between two blocks and a wall.
We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., $5^{100}$) or an irrational number ($\pi$). We only need to access the most…
A large-scale experiment was conducted to find formulas relating to the base $e^\pi$. The numbers in this base are $$x = \sum_{n=0}^\infty {a(n)\over e^{\pi n}}$$ where $a(n)$ is taken from the OEIS catalog. These experiments were inspired…
We extend the scope of B. Shapirovskii's results [B.E Shapirovskii, "Cardinal invariants in Compact Hausdorff Spaces," Amer. Math. Soc. Transl. (2) Vol. 134, 1987, pp. 93-118] on the order of $\pi$-bases in compact spaces and answer some…
Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…
The aim of this paper is to generalize the algorithm to compute jumping numbers on rational surfaces described in [AAD14] to varieties of dimension at least 3. Therefore, we introduce the notion of $\pi$-antieffective divisors, generalizing…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
Processors may find some elementary operations to be faster than the others. Although an operation may be conceptually as simple as some other operation, the processing speeds of the two can vary. A clever programmer will always try to…
This article gives a direct formula for the computation of B(n) using the asymptotic formula $$B (n) \approx 2 {\frac {n!}{{\pi}^{n}{2}^{n}}}$$ where n is even and $n >> 1$. This is simply based on the fact that $\zeta (n)$ is very near 1…
In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…
We prove that five ways to define entry A086377 in the On-Line Encyclopedia of Integer Sequences do lead to the same integer sequence.
This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…
By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).
We show among others that the formula: $$ \lfloor n + \log_{\Phi}\{\sqrt{5}(\log_{\Phi}(\sqrt{5}n) + n) -5 + \frac{3}{n}\} - 2 \rfloor (n \geq 2), $$ (where $\Phi$ denotes the golden ratio and $\lfloor \rfloor$ denotes the integer part)…
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.
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
In the paper, the authors establish an explicit formula for computing Bernoulli polynomials at non-negative integer points in terms of $r$-Stirling numbers of the second kind.
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…
A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…