4
$\begingroup$

As we know $3^1-2^1 = 1$ and of course $3^2-2^3 = 1$. The question is that whether set $$ \{\ (m,n)\in \mathbb{N}\quad |\quad |3^m-2^n| = 1 \} $$

is finite or infinite.

$\endgroup$
  • 4
    $\begingroup$ well en.wikipedia.org/wiki/Catalan%27s_conjecture has been proved by mihailescu. Or are you looking at a simpler proof that does not use that theorem? $\endgroup$ – Ant Oct 4 '14 at 18:48
  • $\begingroup$ Thanks a lot.How it proves does not matter for me. What we have for other integers? $\endgroup$ – Abdollah Oct 4 '14 at 18:50
  • 1
    $\begingroup$ Have you read the link? It says that the only solution to $x^a - y^b = 1$ , where $x, y, a, b$ are integers, is $3^2 - 2^3 = 1$. So for other integers your set is empty! $\endgroup$ – Ant Oct 4 '14 at 18:53
  • $\begingroup$ Integers larger than $1$. Just correcting in case someone reading gets confused. $\endgroup$ – Slade Oct 4 '14 at 18:57
  • $\begingroup$ Relate MO post: Are there any solutions to $2^n-3^m=1$. $\endgroup$ – Martin Sleziak Sep 16 '17 at 16:10
5
$\begingroup$

Note first that if $3^{2n}-1=2^r$ then $(3^n+1)(3^n-1)=2^r$. The two factors in brackets differ by $2$ so one must be an odd multiple of $2$, and this is only possible if $n=1$ (the only odd number we can allow in the factorisation is $1$)

Now suppose that $3^n-1=2^r$ and $n$ is odd. Now $3^n\equiv -1$ mod $4$ so $3^n-1$ is not divisible by $4$.

Now suppose $3^n=2^{2r}-1=(2^r+1)(2^r-1)$. The two factors differ by $2$ and cannot therefore both be divisible by $3$. Only $r=1$ is possible.

The final case is $3^n=2^{k}-1$ where $k$ is odd. Now the right hand side is $\equiv -2$ mod $3$, so only $k=1$ is possible, and $n=0$ (if permitted).

__

The previous version of this answer was overcomplicated - trying to do things in a hurry.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.