Additive properties of numbers with restricted digits (Q2045160)

The paper deals with integers having \textit{restricted digits} in an integer base \(b\geq 3\): let \(B_b\) be the set of all positive integers having only digits from \(\{0,1\}\) in their base-\(b\) expansions. The author proves the following theorem. \noindent \textbf{Theorem.} Let \(a\), \(b\), \(c\geq 3\) be pairwise multiplicatively independent integers such that \[ \frac{\log 2}{\log a}+\frac{\log 2}{\log b}+\frac{\log 2}{\log c}<1. \] Then, for each \(\epsilon>0\), the number of solutions \((x,y,z)\in B_a\times B_b\times B_c\) of \(x+y=z\), with \(z\le N\), is \(O(N^\epsilon)\). The author conjectures that, under the premises of the theorem, the total number of solutions is in fact finite.