Approximating any integer by multiples of 2 and 3 Given any integer $n$ sufficiently large, I want to prove (or disprove) that there exists another integer $m\ge n$ with the form $m=2^a3^b$ ($a,b$ are no negative integers) such that $m-n=o(n)$, i.e., $n$ can be approximated by $m$.
 A: Fix $\varepsilon>0$. We have to prove (for large enough $n$) that there exist non-negative integers $a,b$ such that $\log_2 n\leqslant a+b\log_2 3<\log_2 n+\varepsilon$. This follows from the fact that fractional parts of $b\alpha$, $\alpha:=\log_2 3$, are dense in $(0,1)$. Indeed, choose non-negative integers $b_1,\dots,b_k$ so that fractional parts of $b_i\alpha$ form an $\varepsilon/2$-net of $[0,1]$. Then we may choose $b\in\{b_1,\dots,b_k\}$ and appropriate integer $a$. This $a$ is positive provided that $n$ is large enough.
A: I believe replacing $o(n)$ by $O(n^a)$ for $0 < a < 1$ contradicts the $abc$ conjecture. Fix small natural $b$ coprime to $6$ (say $5$) and set $n=b^k$ for natural $k$.
In the abc triple $(m-n,n,m)$ the radical is $O(n^a)$ while $c$ is $b^k$, giving fixed quality of $\frac1a > 1$ infinitely often as $k$ varies (2,3 and $b$ dont contribute essentially anything to the radical).
This doesn't rule bound of the form something like $n/\log{n}$, but I suspect the answer to the question is negative.
