Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For any $\forall k\in N^{+}$ show that the diophantine equation $3^x-2^y=k$ have finitely many integral solutions.

My try: if $k=2m$,then $$3^x=2^y+k=2^y+2m$$ It is clear there is no integer solution,

But for $k=2m+1$, I can't prove three finitely many integral solution.

Thank you.

share|cite|improve this question
This is a result of Størmer's theorem.ørmer's_theorem – Ryan Jun 15 '14 at 4:51
Hello,Thank you,can you find somepaper reseacher this problem,I find sometime,I can't find paper. – math110 Jun 15 '14 at 4:57

This is a result of a theorem due to Carl Størmer. His theorem can be stated as follows:

Let $S=\left\{ p_1^{e_1} p_2^{e_2} \cdots p_j^{e_i} \mid e_i \in \mathbb{N}_0 \right\}$, where $p_1$, $p_2 \cdots p_j$ is a finite collection of prime numbers. Then there are a finite number of pairs $x,y \in S$ such that $x-y=k$ (for fixed $k$).

Unfortunately, the wikipedia page for the theorem only considers the $k=1$ case, when in fact Størmer had proven it for all integer values of $k$.




share|cite|improve this answer
It's not immediately clear how $k=1$ could have any solutions, since $S$ would be a single-element set... – abiessu Jun 15 '14 at 5:33
Ah, oops, inconsistent variables. This is what happens when I'm running low on sleep.. – Ryan Jun 15 '14 at 5:36
Hello,this theorem how prove it? – math110 Jun 15 '14 at 6:14
@math110 Check the first link, an article titled "On a problem of Stormer" by D. Lehmer. Also I have heard of an article titled "A generalization of the Stormer theorem and some applications" which I have not read, but it sounds promising. These should provide constructive proofs. – Ryan Jun 15 '14 at 6:26
Does stormers theorem guarantee that there exist solutions, or only that there can be at most a finite number of them? – abiessu Jun 15 '14 at 14:15

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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