Related papers: A BBP-style computation for $\pi$ in base 5
We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some…
Probabilistic databases (PDBs) model uncertainty in data. The current standard is to view PDBs as finite probability spaces over relational database instances. Since many attributes in typical databases have infinite domains, such as…
We compute a Monte Carlo approximation of {\pi} using importance sampling with shots coming out of a Mossberg 500 pump-action shotgun as the proposal distribution. An approximated value of 3.131 is obtained, corresponding to a 0.33% error…
We give a closed formula for the $n^{th}$ derivative of $\arctan x$. A new expansion for $\arctan x$ is also obtained and rapidly convergent series for $\pi$ and $\pi\sqrt 3$ are derived.
Digital computers store information in the form of bits that can take on one of two values 0 and 1, while quantum computers are based on qubits that are described by a complex wavefunction, whose squared magnitude gives the probability of…
A phenomenological analysis based on the published branching fractions and $CP$ asymmetry observables of the $B\to K\pi$, $B\to\pi\pi$ and $B\to KK$ dataset is performed. The amplitude decomposition by the topological diagrams and the…
In science, as in life, `surprises' can be adequately appreciated only in the presence of a null model, what we expect a priori. In physics, theories sometimes express the values of dimensionless physical constants as combinations of…
The main aim of this paper is to further develop the multiple-correction method that formulated in our previous works~\cite{CXY, Cao}. As its applications, we establish a kind of hybrid-type finite continued fraction approximations related…
We show any power of five may be expressed arithmetically with the digits of its decimal representation. We also show powers of five (in decimal) contain any amount of zeros in a row.
This work presents and extends a known spigot-algorithm for computing square-roots, digit-by-digit, that is suitable for calculation by hand or an abacus, using only addition and subtraction. We offer an elementary proof of correctness for…
In "Playing Pool with $\pi$", Galperin invented an extraordinary method to learn the digits of $\pi$ by counting the collisions of billiard balls. Here I demonstrate an exact isomorphism between Galperin's bouncing billiards and Grover's…
Numerous algorithms call for computation over the integers modulo a randomly-chosen large prime. In some cases, the quasi-cubic complexity of selecting a random prime can dominate the total running time. We propose a new variant of the…
We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
We show how to find series expansions for $\pi$ of the form $\pi=\sum_{n=0}^\infty {S(n)}\big/{\binom{mn}{pn}a^n}$, where S(n) is some polynomial in $n$ (depending on $m,p,a$). We prove that there exist such expansions for $m=8k$, $p=4k$,…
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…
In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…
We give explicit formulas for the Betti numbers, both stable and unstable, of the unordered configuration spaces of an arbitrary surface of finite type.
This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…
A computational abstract machine based on two operations: referencing and bit copying is presented. These operations are sufficient for carrying out any computation. They can be used as the primitives for a Turing-complete programming…