Related papers: Rational approximation with digit-restricted denom…
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…
For a given base $\gamma$ and a digit set ${\mathcal B}$ we consider optimal representations of a number $x$, as defined by Dajani at al. in 2012. For a non-integer negative base $\gamma=-\beta<-1$ and the digit set ${\mathcal…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
We study the problem of Diophantine approximation on lines in $\mathbb{C}^2$ with numerators and denominators restricted to Gaussian primes. To this end, we develop analogs of well-known results on small fractional parts of $p\gamma$, $p$…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
Let x be a point in R^2 with irrational slope and let \Gamma denote the lattice SL(2,Z) acting linearly on R^2. Then, the orbit \Gamma x is dense in R^2. We give efective results on the approximation of a point y in R^2 by points of the…
We give an elementary geometric proof using Ford circles that the convergents of the continued fraction expansion of a real number $\alpha$ coincide with the rationals that are best approximations of the second kind of $\alpha$.
In this paper we present an alternative approach to a problem dealt with by Rosales et al. In particular, once a base $b$ for the representation of the integers is fixed, we describe a procedure for constructing the smallest multiplicative…
Generating functions for a fixed genus map and hypermap enumeration become rational after a simple explicit change of variables. Their numerators are polynomials with integer coefficients that obey a differential recursion, and denominators…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
Let $b \geq 3$ be an integer and $C(b,D)$ be the set of real numbers in $[0,1]$ whose base $b$ expansion only consists of digits in a set $D \subseteq \{0,...,b-1\}$. We study how close can numbers in $C(b,D)$ be approximated by rational…
Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…
Building upon previous works of Andr{\'e} and Chudnovsky, we prove a general result concerning the approximations of values at rational points a/b of any G-function F with rational Taylor coefficients by fractions of the form n/(B…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
We examine a family of three-dimensional exponential sums with monomials and provide estimates which are in some instances sharper than those stemming from approaches entailing the use of existing bounds pertaining to analogous sums.
Two approximations, derived from continuous expansions of Riemann-Liouville fractional derivatives into series involving integer order derivatives, are studied. Using those series, one can formally transform any problem that contains…
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
We investigate the problem of best simultaneous Diophantine approximation under a constraint on the denominator, as proposed by Jurkat. New lower estimates for optimal approximation constants are given in terms of critical determinants of…