Cantor series expansions of rational numbers
نویسندگان
چکیده
This survey is devoted to necessary and suffcient conditions for a rational number be representable by Cantor series. Necessary are formulated the case of an arbitrary sequence $(q_k)$.
منابع مشابه
Beta-expansions of rational numbers in quadratic Pisot bases
We study rational numbers with purely periodic Rényi β-expansions. For bases β satisfying β2 = aβ + b with b dividing a, we give a necessary and sufficient condition for γ(β) = 1, i.e., that all rational numbers p/q ∈ [0, 1) with gcd(q, b) = 1 have a purely periodic β-expansion. A simple algorithm for determining the value of γ(β) for all quadratic Pisot numbers β is described.
متن کاملRandomness Relative to Cantor Expansions
Imagine a sequence in which the first letter comes from a binary alphabet, the second letter can be chosen on an alphabet with 10 elements, the third letter can be chosen on an alphabet with 3 elements and so on. When such a sequence can be called random? In this paper we offer a solution to the above question using the approach to randomness proposed by Algorithmic Information Theory. 1 Varyin...
متن کاملRational Points in Cantor Sets
The Idea for this article was given by a problem in real analysis. We wanted to determine the one-dimensional Lebesgue-measure of the set f(C)9 where C stands for the classical triadic Cantor set and/is the Cantor-function, which is also known as "devil's staircase." We could see immediately that to determine the above measure we needed to know which dyadic rationals were contained in C. We soo...
متن کاملSeries of Error Terms for Rational Approximations of Irrational Numbers
Let pn/qn be the n-th convergent of a real irrational number α, and let εn = αqn−pn. In this paper we investigate various sums of the type ∑ m εm, ∑ m |εm|, and ∑ m εmx m. The main subject of the paper is bounds for these sums. In particular, we investigate the behaviour of such sums when α is a quadratic surd. The most significant properties of the error sums depend essentially on Fibonacci nu...
متن کاملFast Multiprecision Evaluation of Series of Rational Numbers
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O((logN)M(N)), whereM(N) is the time needed to multiply twoN -bit numbers. Applications include fast algorithms for elementary functions, π, hypergeometric functions at rational points, ζ(3), Euler’s, Catalan’s and Apéry...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematics
سال: 2022
ISSN: ['2336-1298', '1804-1388']
DOI: https://doi.org/10.46298/cm.10454