Let J ⊂ ℝ² be the set of couples (x,q) with q > 1 such that x has at least one representation of the form $x={\sum }_{i=1}^{\infty }{c}_i{q}^{-i}$ with integer coefficients $c_i$ satisfying $0\le c_i<q$, i ≥ 1. In this case we say that $\left(c_i\right)=c₁c₂...$ is an expansion of x in base q. Let U be the set of couples (x,q) ∈ J such that x has exactly one expansion in base q. In this paper we deduce some topological and combinatorial properties of the set U. We characterize the closure of U, and we determine its Hausdorff dimension. For (x,q) ∈ J, we also prove new properties...

Let $\alpha \&gt;1$ be irrational. Several authors studied the numbers$${\ell }^m\left(\alpha \right)=inf\left\{\right|y|:y\in {\Lambda }_m,y\ne 0\},$$where $m$ is a positive integer and ${\Lambda }_m$ denotes the set of all real numbers of the form $y={ϵ}_0{\alpha }^n+{ϵ}_1{\alpha }^{n-1}+\cdots +{ϵ}_{n-1}\alpha +{ϵ}_n$ with restricted integer coefficients $|{ϵ}_i|\le m$. The value of ${\ell }^1\left(\alpha \right)$ was determined for many particular Pisot numbers and ${\ell }^m\left(\alpha \right)$ for the golden number. In this paper the value of ${\ell }^m\left(\alpha \right)$ is determined for irrational numbers $\alpha$, satisfying ${\alpha }^2=a\alpha \pm 1$ with a positive integer $a$.

Let β ∈ (1,2) and x ∈ [0,1/(β-1)]. We call a sequence ${\left({ϵ}_i\right)}_{i=1}^{\infty }\in {0,1}^{\mathbb{N}}$ a β-expansion for x if $x={\sum }_{i=1}^{\infty }{ϵ}_i{\beta }^{-i}$. We call a finite sequence ${\left({ϵ}_i\right)}_{i=1}^n\in {0,1}^n$ an n-prefix for x if it can be extended to form a β-expansion of x. In this paper we study how good an approximation is provided by the set of n-prefixes. Given $\Psi :\mathbb{N}\to {ℝ}_{\ge 0}$, we introduce the following subset of ℝ: $W_{\beta }\left(\Psi \right):={\bigcap }_{m=1}^{\infty }{\bigcup }_{n=m}^{\infty }{\bigcup }_{{\left({ϵ}_i\right)}_{i=1}^n\in {0,1}^n}[{\sum }_{i=1}^n\left({ϵ}_i\right)/\left({\beta }^i\right),{\sum }_{i=1}^n\left({ϵ}_i\right)/\left({\beta }^i\right)+\Psi \left(n\right)]$In other words, $W_{\beta }\left(\Psi \right)$ is the set of x ∈ ℝ for which there exist infinitely many solutions to the inequalities $0\le x-{\sum }_{i=1}^n\left({ϵ}_i\right)/\left({\beta }^i\right)\le \Psi \left(n\right)$. When ${\sum }_{n=1}^{\infty }{2}^n\Psi \left(n\right)<\infty$, the Borel-Cantelli lemma tells us that the Lebesgue measure of $W_{\beta }\left(\Psi \right)$ is...

In this paper, we look at various arithmetic properties of the set of those positive integers n whose sum of digits in a fixed base b &gt; 1 is a fixed positive integer s. For example, we prove that such integers can have many prime factors, that they are not very smooth, and that most such integers have a large prime factor dividing the value of their Euler φ function.

We consider positional numeration system with negative base $-\beta$, as introduced by Ito and Sadahiro. In particular, we focus on arithmetical properties of such systems when $\beta$ is a quadratic Pisot number. We study a class of roots $\beta >1$ of polynomials $x^2-mx-n$, $m\ge n\ge 1$, and show that in this case the set $\mathrm{Fin}(-\beta )$ of finite $(-\beta )$-expansions is closed under addition, although it is not closed under subtraction. A particular example is $\beta =\tau =\frac{1}{2}(1+\sqrt{5})$, the golden ratio. For such $\beta$, we determine the exact bound on the number of fractional digits...

We study values of the Euler function φ(n) taken on binary palindromes of even length. In particular, if ${ℬ}_{2\ell }$ denotes the set of binary palindromes with precisely 2ℓ binary digits, we derive an asymptotic formula for the average value of the Euler function on ${ℬ}_{2\ell }$.

Canonical number systems can be viewed as natural generalizations of radix representations of ordinary integers to algebraic integers. A slightly modified version of an algorithm of B. Kovács and A. Pethő is presented here for the determination of canonical number systems in orders of algebraic number fields. Using this algorithm canonical number systems of some quartic fields are computed.