相关论文: Approximating 1 from below using $n$ Egyptian frac…

Given a list of N numbers, the maximum can be computed in N iterations. During these N iterations, the maximum gets updated on average as many times as the Nth harmonic number. We first use this fact to approximate the Nth harmonic number…

The Diophantine sums $\sum_{n=1}^N \| n \alpha \|^{-1}$ and $\sum_{n=1}^N n^{-1} \| n \alpha \|^{-1}$ appear in many different areas including the ergodic theory of circle rotations, lattice point counting and random walks, often in…

We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…

We count the number of subsets of $\{1,2,\cdots,n\}$ under different conditions and study the sequence obtained as we let $n$ increase.

A complete p-adic Khintchine type theorem for approximation by p-adic algebraic numbers is established.

In this article we present ways to evaluate certain sums, products and continued fractions using tools from the theory of elliptic functions. The specific results appear to be new, although similar ones can be found in the leterature; in…

We show a new method of estimating the Hausdorff measure (of the proper dimension) of a fractal set from below. The method requires computing the subsequent closest return times of a point to itself.

We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…

In this article, for a certain subset $\mathcal{X}$ of the extended set of rational numbers, we introduce the notion of {\it best $\mathcal{X}$-approximations} of a real number. The notion of best $\mathcal{X}$-approximation is analogous to…

We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some linear methods of this approximation for univariate functions in the class induced by the convolution…

In computational practice, most attention is paid to rational approximations of functions and approximations by the sum of exponents. We consider a wide enough class of nonlinear approximations characterized by a set of two required…

The Simpson's formula is obtained by approximating the integral of a function on some interval by the integral of the quadratic polynomial determined by the function. However, a multidimensional analogue of the formula has not been given as…

Adapting Cantor set methods that were used by Hall and Hlawka for regular continued fractions, we prove that every real number can be obtained as the sum of two real numbers for which the partial fractions in their nearest integer continued…

We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…

We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show…

In this paper, we present an improved continued fraction approximation of the Wallis ratio. This approximation is fast in comparison with the recently discovered asymptotic series. We also establish the double-side inequality related to…

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

The focus of this note is to formulate the algorithms and give the examples used by Fibonacci in Liber Abaci to expand any fraction into a sum of unit fractions. The description in Liber Abaci is all verbal and the examples are numbers…

We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…