Finiteness conjecture for restricted-digit additive triples

Let b3b\geq 3 be an integer, and let BbB_b denote the set of positive integers whose base-bb expansion contains only the digits 00 and 11. Let a,b,c3a,b,c\geq 3 be pairwise multiplicatively independent integers, meaning that loga/logb\log a/\log b, loga/logc\log a/\log c, and logb/logc\log b/\log c are irrational. Restricted-digit additive-triples conjecture. If

log2loga+log2logb+log2logc<1,\frac{\log 2}{\log a}+\frac{\log 2}{\log b}+\frac{\log 2}{\log c}<1,

then there are only finitely many integers (x,y,z)Ba×Bb×Bc(x,y,z)\in B_a\times B_b\times B_c such that

x+y=z.x+y=z.

The conjecture predicts finiteness in the dimension-sum-below-one regime. The paper presents it as a suspected consequence of the thinness of the restricted-digit sets; related results establish strong upper bounds, but the asserted finiteness is not supplied as a theorem here.

Sources & referencesView supporting material

Primary source

Han Yu, “Additive properties of numbers with restricted digits”, arXiv:2004.05926 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.