On equal values of trinomials (Q633265): Difference between revisions

Let \(a, b, c, d, e, m, n, p\) and \(q\) be fixed rational integers. In this paper the authors prove the following very precise result Theorem. The Diophantine equation \[ ax^m + bx^n + c = dy^p + ey^q , \] where \(m > n > 0\), \(p > q > 0\), \(\gcd(m, n) = \gcd(p, q) = 1\), \(ab de\not= 0\) and either \(m > p = 3\) or \(m = p = 3\) and \(n \geq q\) has infinitely many rational solutions \(x\), \(y\) with a bounded denominator if and only if either \[ m = p, \quad n = q, \quad a = dt^m, \quad b = et^n, \quad t \in {\mathbb Q}, \quad c = 0, \] or \[ m = p = 3, \quad n = q = 2,\quad a^2e^3 + b^3d^2 = 0, \quad c = - {4b^3 \over 27a^2 }, \] or \[ m = p = 3, \quad n = 2, \quad q = 1, \quad 27a^4e^3 + b^6d = 0, \quad c = -{3a^2e^3 + b^3e^2 \over 3b^3d}. \] The main ingredient in the proof of this Theorem is the Bilu-Tichy Theorem -- an ineffective result -- so this result provides the finiteness of the number of solutions, only. In the special case \(p = 2\) the authors are able to give an upper bound for the solutions \(x\) and \(y\). A result of Brindza on solutions of hyperelliptic equations plays an important role in the proof.