On the uniqueness of the expansions \(1=\sum q^{-n_i}\) (Q1187330)

For a real number \(1<q<2\), consider the equation \(1=\sum^{+\infty}_{n=1}e_n/q^n\), where \(e_n=0\) or 1. The digits \(e_n\) can uniquely be determined only if an algorithm is given for the preceding expansion; see [\textit{J. Galambos}, Representations of real numbers by infinite series (1976; Zbl 0322.10002), pp. 3, 13 and 62]. Otherwise, for most \(q\), there are infinitely many ways for obtaining the sequence \(e_n\), \(n\geq 1\). The paper is devoted to analyzing the structure and the size of the set \(\{e_n, n\geq 1\}\) in the absence of an algorithm.