Related papers: Distant decimals of $\pi$

Differential privacy is a de facto standard for statistical computations over databases that contain private data. The strength of differential privacy lies in a rigorous mathematical definition that guarantees individual privacy and yet…

We establish rigorous error bounds for prime counting using a truncated Gaussian (TG) kernel in the explicit formula framework. Our main theorem proves that the approximation error remains globally below 1/2 for all sufficiently large…

We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are…

In this paper a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam & Bora (Linear Algebra Appl., 396 (2005), pp.~273--301) and reduces to…

In this paper we consider the numerical solution of fractional differential equations. In particular, we study a step-by-step graded mesh procedure based on an expansion of the vector field using orthonormal Jacobi polynomials. Under mild…

Let $b$ be a numeration base. A $b$-Niven number is one that is divisible by the sum of its base $b$ digits. We introduce high degree $b$-Niven numbers. These are $b$-Niven numbers that have a power greater than $1$ that is $b$-Niven…

A simple computer-based algorithm has been developed to identify pre-modern coins minted from the same dies, intending mainly coins minted by hand-made dies designed to be applicable to images taken from auction websites or catalogs. Though…

We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…

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…

For a class of tempered fractional terminal value problems of the Caputo type, we study the existence and uniqueness of the solution, analyse the continuous dependence on the given data and using a shooting method, we present and discuss…

The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing the overhead required for fault-tolerant quantum…

Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…

Unlike some other formal systems, the proof system Metamath has no built-in concept of "decimal number" in the sense that arbitrary digit strings are not recognized by the system without prior definition. We present a system of theorems and…

We present a unified constructive digit-by-digit framework for exact root extraction using only integer arithmetic. The core contribution is a complete correctness theory for the fractional square root algorithm, proving that each computed…

A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…

Given a dataset of $n$ i.i.d. samples from an unknown distribution $P$, we consider the problem of generating a sample from a distribution that is close to $P$ in total variation distance, under the constraint of differential privacy (DP).…

We study computational methods for computing the distance to singularity, the distance to the nearest high index problem, and the distance to instability for linear differential-algebraic systems (DAEs) with dissipative Hamiltonian…

We perform an extended numerical search for practical fermion-to-qubit encodings with error correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high…

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…

We analyze a system of fermionic $^{6}$Li atoms in an optical trap, and show that an atom "on demand" can be prepared with ultra-high fidelity, exceeding 0.99998. This process can be scaled to many sites in parallel, providing a realistic…