 Solution

Put $\Lambda =n\log 2-m\log 3$. It is nonzero by unique prime factorization. If $3^m\le 2^{n-1}$ or $3^m\ge 2^{n+1}$, the claimed inequality follows immediately after increasing the effective constant. We may therefore assumewhich implies $m\asymp n$.

The Baker lower bound for a homogeneous linear form in logarithms, with the fixed algebraic numbers $2$ and $3$, givesfor an effective absolute constant $C_0$. If $|\Lambda |>1$, the desired conclusion is again immediate. Otherwise, the mean value theorem applied to the exponential function on $[-1,1]$ gives $|e^u-1|\ge c|u|$. HenceAbsorbing the fixed factor into a larger exponent proves $|2^n-3^m|\ge 2^n/n^C$.

Solved by gpt-5.6-sol high.