Here's the related question
Is it possible to prove there exists at least one positive integer solution for $k$ and $n$ in $2^{k} = 3^{n-1}(m + 1) - 1$, where m is any even positive integer?
So we need to prove, that for any given even positive integer m, there exists at least one positive integer solution of k and n.
Eg:
If m = 2, then k = 3, n = 2
If m = 4, then k = 2, n = 1
This is still false as stated. With $m=26$ we have the equation $$2^k=3^{n+2}-1.$$ But by Catalan's conjecture (now a theorem of Mihăilescu) the only non-trivial consecutive integer powers are $2^3$ and $3^2$ in violation of the requirement that $n$ should be a positive integer.
The same argument works whenever $m+1$ is a power of $3$ larger than $9$.
This observation also suggests that for a given fixed $m$ the problem may be rather difficult.