Related papers: Continued fractions with minimal remainders

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…

Recently, a new fractional derivative called the conformable fractional derivative is given on based basic limit definition derivative in [4]. Then, the fractional versions of chain rules, exponential functions, Gronwalls inequality,…

A reasonably complete theory of the approximation of an irrational by rational fractions whose numerators and denominators lie in prescribed arithmetic progressions is developed in this paper. Results are both, on the one hand, from a…

We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

In this paper we introduce a new mathematical tool to solve fractional equations representing models of fractional systems : The Ultradistributions. Ultradistributions permit us to unify the notion of integral and derivative in one only…

In this paper we define "a continued fraction expansion of the exponential integral $E_{1}(x)$ at infinity", which is analogous to the regular continued fraction expansion of real numbers, and prove that this expansion gives the same…

We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…

We prove a sequence of limiting results about weakly dependent stationary and regularly varying stochastic processes in discrete time. After deducing the limiting distribution for individual clusters of extremes, we present a new type of…

A unit fraction representation of a rational number $r$ is a finite sum of reciprocals of positive integers that equals $r$. Of particular interest is the case when all denominators in the representation are distinct, resulting in an…

In this paper we present some results related to the problem of finding periodic representations for algebraic numbers. In particular, we analyze the problem for cubic irrationalities. We show an interesting relationship between the…

By using Euler's approach of using Euclid's algorithm to expand a power series into a continued fraction, we show how to derive Ramanujan's $q$-continued fractions in a systematic manner.

We introduce the continued logarithm representation of real numbers and prove results on the occurrence and frequency of digits with respect to this representation

We derive a functional central limit theorem (fclt) for normalised sums of a function of the partial sums of independent and identically distributed random variables. In particular, we show, using a technique presented in Huang and Zhang…

We present a new formula for umbral operators that yields three main insights. First, it makes explicit a connection between umbral calculus and iteration theory. Second, it leads naturally to a definition of fractional exponents of umbral…

Denote by {$\times$} the fractional part. We establish several new metrical results on the distribution properties of the sequence ({x n }) n$\ge$1. Many of them are presented in a more general framework, in which the sequence of functions…

Fracterms are introduced as a proxy for fractions. A precise definition of fracterms is formulated and on that basis reasonably precise definitions of various classes of fracterms are given. In the context of the meadow of rational numbers…

We prove a local limit theorem for the Euclidian algorithms ; standard, centred and odd, with any cost function of moderate growth.

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…