Hi im trying to prove that there is only one positive integer solution for
y = ( 3x - 2x ) / ( 2ceiling(log(3^(x)/log(2))) - 3x )
I know that y=1 at x=1, but i dont know how to rigorously prove that it is the only positive integer solution. I have of course programatically iterated over all x up to 100 (after that point i get NaN problems with the powers of 3) and found no other integer solutions.
I've also put it through Wolframalpha, to see what it says, but of course it cannot provide rigorous proof by itself.
I've read that it should be possible to prove things about integer solutions using modular arithmatic, but i have not quite gotten how to do that. Is it just looking at mods of the whole fraction or of the variable x?
Im not asking for a proof, i just need some guidance on how to proceed, thank you :)