Take the 2-minute tour ×
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.

I was considering some number theory problems which inspired me to write the following conjecture, which bears some resemblance to the Catalan problem, but is in fact different:

Fix two distinct sequences of primes $p_{1}, ..., p_{n}$ and $q_{1}, ..., q_{m}$. Do there exist infinitely many sequences of naturals $a_{1}, ..., a_{n}$, $b_{1}, ..., b_{m}$ such that:

$p_{1}^{a_{1}} ... p_{n}^{a_{n}} - q_{1}^{b_{1}} ... q_{m}^{b_{m}} = 1$?

share|improve this question
    
With one factor each side, do you know what happens with $p=3$ and $q=2$? –  Mark Bennet Jun 15 '12 at 20:30
    
It only has one solution in that case –  Pedro Jun 15 '12 at 20:38
    
I'm interested in cases where at least one of $n, m$ is bigger than 2 –  Pedro Jun 15 '12 at 20:51

2 Answers 2

up vote 2 down vote accepted

Thue proved (http://en.wikipedia.org/wiki/Thue_equation) that the equation $$A \cdot X^k - B \cdot Y^k = 1$$ (for fixed $A$, $B$, and $k$) has only finitely many integral solutions if $k \ge 3$.

Fix two sets of primes $p_i$ and $q_j$. Your equations give integral solutions to a finite number of Thue equations, and thus there can be at most finitely many solutions.

For example (to be very explicit about the construction), any solution to $2^a 3^b - 5^c 7^c = 1$ yields a solution to $$A x^3 - B y^3 = 1$$ with $A \in \{1,2,4,3,6,12,9,18,36\}$ and $B \in \{1,5,25,7,35,175,49,245,1225\}$.

More generally, this problem falls under the broader class of problems known as $S$-unit equations (http://en.wikipedia.org/wiki/S-unit), which are well studied.

share|improve this answer

Conditional on the abc conjecture, the answer is no. We have $1 + \prod q_i^{b_i} = \prod p_i^{a_i}$ and the abc conjecture implies that $$\prod p_i^{a_i} \le (\prod p_i \prod q_i)^2$$

for all but finitely many choices of the $a_i$ and $b_i$. But this condition itself can only hold for finitely many choices of the $a_i$.

share|improve this answer

Your Answer

 
discard

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.