Related papers: A BBP-style computation for $\pi$ in base 5
We connect a primitive operation from arithmetic -- summing the digits of a base-$B$ integer -- to $q$-series and product generating functions analogous to those in partition theory. We find digit sum generating functions to be intertwined…
In this study, we conducted an experiment to estimate $\pi$ using body-to-body and body-to-wall collisions. By geometrically analyzing the system's motion, we first review how the collision count corresponds to the digits of $\pi$. This…
Loop calculations involve the evaluation of divergent integrals. Usually [1] one computes them in a number of dimensions different than four where the integral is convergent and then one performs the analytical continuation and considers…
We utilize the asymmetric random telegraph wave-based instantaneous noise-base logic scheme to represent the problem of drawing numbers from a hat, and we consider two identical hats with the first 2^N integer numbers. In the first problem,…
Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…
This note presents an analytic technique for proving the linear independence of certain small subsets of real numbers over the rational numbers. The applications of this test produce simple linear independence proofs for the subsets of…
In the present paper we explore a way to represent numbers with respect to the base $-\frac32$ using the set of digits $\{0,1,2\}$. Although this number system shares several properties with the classical decimal system, it shows remarkable…
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
Integer division instruction is generally expensive in most architectures. If the divisor is constant, the division can be transformed into combinations of several inexpensive integer instructions. This article discusses the classic…
We construct small (50 and 26 points, respectively) point sets in dimension 5 whose graphs of triangulations are not connected. These examples improve our construction in J. Amer. Math. Soc., 13:3 (2000), 611--637 not only in size, but also…
In a base phi representation a natural number is written as a sum of powers of the golden mean $\varphi$. There are many ways to do this. How many? Even if the number of powers of $\varphi$ is finite, then any number has infinitely many…
We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…
Divergence is not only an important mathematical concept in information theory, but also applied to machine learning problems such as low-dimensional embedding, manifold learning, clustering, classification, and anomaly detection. We…
In this paper we study the sequences defined by the last and the last non-zero digits of $n^n$ in base $b$. For the sequence given by the last digits of $n^n$ in base $b$, we prove its periodicity using different techniques than those used…
Estimating copulas with discrete marginal distributions is challenging, especially in high dimensions, because computing the likelihood contribution of each observation requires evaluating $2^{J}$ terms, with $J$ the number of discrete…
We present a simple recurrent formula to generate the Machin-like expression for calculating $\pi/4$. The method works for any denominator in the starting term and always provides a finite decomposition. We show that the terms in the…
There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…
This paper is concerned with making Bayesian inference from data that are assumed to be drawn from a Bingham distribution. A barrier to the Bayesian approach is the parameter-dependent normalising constant of the Bingham distribution,…