Contributions to the theory of Diophantine equations II. The Diophantine equation y 2 = x 3 + k
- 18 July 1968
- journal article
- Published by The Royal Society in Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences
- Vol. 263 (1139) , 193-208
- https://doi.org/10.1098/rsta.1968.0011
Abstract
This paper is a sequel to Part I (Baker 1968) in which an effective algorithm was established for solving in integers x, y any Diophantine equation of the type y) = m, where ^denotes an irreducible binary form with integer coefficients and degree at least 3. Here the algorithm is utilized to obtain an explicit bound, free from unknown constants, for the size of all the solutions of the equation. As a consequence of the cubic case of the result, it is proved that, for any integer 4= 9, all integers x, y satisfying the equation of the title have absolute values at most exp { (10101 A:|)10 }.Keywords
This publication has 4 references indexed in Scilit:
- Contributions to the theory of diophantine equations I. On the representation of integers by binary formsPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1968
- Diophantine Equations with Special Reference To Elliptic CurvesJournal of the London Mathematical Society, 1966
- An Introduction to the Geometry of NumbersPublished by Springer Nature ,1959
- The Reduction of a Binary Cubic Form (II)Journal of the London Mathematical Society, 1945