On equal values of trinomials (Q633265): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Diophantine equation f(x) = g(y) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On \(S\)-integral solutions of the equation \(y^ m=f(x)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integral points on hyperelliptic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4345355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: EQUATIONS OF THE FORM <i>f</i>(<i>x</i>)=<i>g</i>(<i>y</i>) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility of quadrinomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the diophantine equation \(x^p-x=y^q-y\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the integer solutions of \(y(y+1) = x(x+1) (x+2)\) / rank | |||
Normal rank |
Latest revision as of 23:00, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On equal values of trinomials |
scientific article |
Statements
On equal values of trinomials (English)
0 references
31 March 2011
0 references
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.
0 references
Trinomials
0 references
Bilu-Tichy theorem
0 references
Diophantine equations
0 references