Digit expansions of numbers in different bases (Q2031274)

Questions about digits of integers in some base(s) can often be very simple to ask but extremely difficult to answer, or even largely open. Two such problems are discussed in the paper under review. The first one claims that ``the numbers (in base \(10\)) \(0, 1, 82000\) are the only integers whose base \(3\), \(4\) and \(5\) expansions contain solely the digits \(0, 1\)'' (see, e.g., \url{http://oeis.org/A146025}). The second one, known as Graham's \(1000\)-dollar-problem, asks: ``are there infinitely many integers \(n \geq 1\) such that the binomial coefficient \(\binom{2n}{n}\) is coprime with \(105 = 3 \times 5 \times 7\)?'' Among the nice results in the paper under review, we only cite here two statements on the problems above. \begin{itemize} \item[1.] The integers in the first problem are very rare: let \(A(n)\) be the number of integers \(\leq n\) that contain solely the digits \(0\) and \(1\) in their base \(3\), base \(4\) and base \(5\) expansions, then for every \(\varepsilon > 0\), there exists \(C_{\varepsilon}\) such that \(A(n) \leq C_{\varepsilon} N^{\varepsilon}\). \item[2.] Let \(p_1 < p_2 < p_3\) be three primes. Let \(B(n)\) be the number of integers \(k \leq n\) such that \(\binom{2k}{k}\) is coprime with \(p_1 p_2 p_3\). Then, for \(n\) large enough, one has \(B(n) \leq n^{0.073}\). The exponent \(0.073\) can furthermore be replaced with \(0.026\), assuming Schanuel's conjecture. (Recall that, for \(p_1 p_2 p_3 = 105\), \textit{C. Pomerance} [Am. Math. Mon. 122, No. 7, 636--644 (2015; Zbl 1332.05005)] conjectured, based on a heuristic argument, that, for \(n\) large enough, \(n^{0.025} \leq B(n) \leq n^{0.026}\).) Actually the authors only need a consequence of Schanuel's conjecture, namely that the reals \(1\), \(\log 3/\log 5\), \(\log 3/\log 7\) are \({\mathbb Q}\)-linearly independent. As they indicate, this can probably be proved without proving the full Schanuel conjecture: they actually prove the weaker result that the reals \(1\), \(\log 3/\log 5\), \(\log 3/\log r\) are \({\mathbb Q}\)-linearly independent for at least one \(r \in \{7, 11, 13\}\). \end{itemize} Note that one could add to the references of this paper a paper by \textit{D. Berend} and \textit{J. E. Harmse} [Trans. Am. Math. Soc. 358, No. 4, 1741--1779 (2006; Zbl 1114.11029)]: their Conjecture 2.2 has an application to Graham's problem, which is given in the Question on Page 1747 of that paper.