Pillai's conjecture is a generalization of Catalan's conjecture. It's say that for fixed positive integers $A, B, C$ the equation $Ax^n - By^m = C$ has only finitely many solutions $(x,y,m,n)$ with $(m,n) ≠ (2,2)$.
But if we fix $A=B=1$ and $x=2,y=3$ then we have :
$$2^n-3^m=C$$
My question : Have this equation only finitely many solution for any fixed integer $C$?
For $C=1,-1$ you can see this answer.
Yes, this follows from the following more general result by taking $P = \{2,3\}$:
In other words, the set of $r$-smooth numbers for any fixed $r$ is very sparse. This result can be deduced easily from standard theorems on finiteness for high-genus polynomial Diophantine equations. It was previously discussed on this site here:
Gap between smooth integers tends to infinity (Stoermer-type result)?
And some of the details were described in my answer to a related question:
https://math.stackexchange.com/a/725149/30402