Abstract.
We consider the (q, δ) numeration system, with basis q≥2 and the set of digits {δ, δ+1, … , q+δ−1} where −(q−1)≤δ≤0. We study properties of numbers where some digits do not occur. This is analogous to the Cantor set {0.a 1 a 2⋯∣a i ∈{0,2}}. We compute an asymptotic equivalent of the nth moment of the “Cantor (q, D)-distribution” which can be described as the numbers 0. w 1 w 2… with w i ∈D⊆{δ, … , q+δ−1}, and each such letter can occur with the same probability 1/Card D. Furthermore, we consider n random strings according to the distribution and the expected minimum of them. We find a recursion which we solve asymptotically.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
This author was supported by the CNRS/NRF-project no 10959. Part of this work was done during the first author’s visit to the John Knopfmacher Centre for Applicable Analysis and Number Theory at the University of the Witwatersrand, Johannesburg, South Africa.
This author was supported by the CNRS/NRF-project no 10959.
Rights and permissions
About this article
Cite this article
Bassino, F., Prodinger, H. (q, δ)-Numeration Systems with Missing Digits. Monatsh. Math. 141, 89–99 (2004). https://doi.org/10.1007/s00605-002-0008-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-002-0008-z