Related papers: $\pi$-formulas and Gray code

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…

Nowadays there are several classes of constrained codes intended for different applications. The following two large classes can be distinguished. The first class contains codes with local constraints; for example, the source data must be…

Using mostly elementary results and functions from probability, we prove Wallis's formula for pi: pi/2 = prod_n (2n * 2n) / ((2n-1) * (2n+1)). The proof involves normalization constants and the Gamma function, Standard normal, and the…

We give the asymptotic distribution of the zeros of Jacobi-Pi\~neiro polynomials and multiple Laguerre polynomials of the first kind. We use the nearest neighbor recurrence relations for these polynomials and a recent result on the ratio…

A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…

We derive a BBP-type formula for the remainder of the Madhava-Gregory-Leibniz series for $\pi$. The result is a closed form in base-$16$ with Pochhammer denominators. The analogous formula for the alternating series for $\log 2$ is also…

For any integer $n\geq 1$ a middle levels Gray code is a cyclic listing of all bitstrings of length $2n+1$ that have either $n$ or $n+1$ entries equal to 1 such that any two consecutive bitstrings in the list differ in exactly one bit. The…

Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta x^{2^k+1}+\ga…

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

The aim of this paper is to introduce Bell polynomials and numbers of the second kind and poly-Bell polynomials and numbers of the second kind, and to derive their explicit expressions, recurrence relations and some identities involving…

We obtained a new formula for $\pi$.

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

In 1914, Ramanujan presented a collection of 17 elegant and rapidly converging formulae for $\pi$. Among these, one of the most celebrated is the following series:…

In \cite{TallaWaffo2025arxiv2511.02843} we introduced even polynomials $\Xi_n,\Lambda_n\in\mathbb{Q}[x]$ arising from integral representations of $\beta(2n)/\pi^{2n-1}$ and $\zeta(2n+1)/\pi^{2n}$. In this paper we give explicit closed…

A binary partition of a positive integer $n$ is a partition of $n$ in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary partitions of $n$. This is an ordering of the set of binary…

An $n$-bit Gray code is a sequence of all $n$-bit strings such that consecutive strings differ in a single bit. It is well-known that given $\alpha,\beta\in\{0,1\}^n$, an $n$-bit Gray code between $\alpha$ and $\beta$ exists iff the Hamming…

A modified Lagrange Polynomial is introduced for polynomial extrapolation, which can be used to estimate the equally spaced values of a polynomial function. As an example of its application, this article presents a prime-generating…

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…

In our earlier publication we have shown how to compute by iteration a rational number ${u_{2,k}}$ in the two-term Machin-like formula for pi of kind…

Given a complex polynomial $p(z)$ of degree $n$ and an ellipse, we find an algorithm of determining the number of zeros of $p$ in the interior and exterior of the ellipse. Our results generalize the previous results of Pt\'ak and Young…