15
$\begingroup$

The ABC conjecture states that there are a finite number of integer triples (a,b,c) such that $\frac {\log \left( c \right)}{\log \left( \text{rad} \left( abc \right) \right)}>1+\varepsilon $, where $a+b=c$ and $\varepsilon > 0$.

I am however more interested in a weaker version of the ABC conjecture where the following inequality holds true: $\frac {\log \left( c \right)}{\log \left( a \: \text{rad} \left( bc \right) \right)}>1+\varepsilon $. This weaker conjecture has a number of applications in music theory - specifically concerning temperament theory.

It is easy to see that this conjecture is implied by the ABC conjecture. However, I was wondering if there is a way to prove it without relying on ABC. Any clue where to start?

  • 1
    Posted on MathOverflow: http://mathoverflow.net/questions/112133/a-weaker-version-of-the-abc-conjecture2012-11-12

1 Answers 1

17

Your conjecture is still open. Fix an integer $k$; your conjecture implies that there are finitely many solutions to the equation $y^m = x^n + k$ for exponents $n$, $m$ greater than one. For $k = 1$, this is Catalan's conjecture, which is now a theorem, but for $k > 1$ the finiteness of the number of solutions is still unknown; see http://en.wikipedia.org/wiki/Tijdeman%27s_theorem.

  • 0
    They are in no sense "nearly equivalent". Solving equations in S-integers is *much* easier; you may as well say that solving $x^n+y^n=z^n$ in $S$-integers is "nearly equivalent" to Fermat's Last Theorem.2012-11-13