Integer points on curves of genus 1
- 1 May 1970
- journal article
- research article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 67 (3) , 595-602
- https://doi.org/10.1017/s0305004100045904
Abstract
1. Introduction. A well-known theorem of Siegel(5) states that there exist only a finite number of integer points on any curve of genus ≥ 1. Siegel's proof, published in 1929, depended, inter alia, on his earlier work concerning rational approximations to algebraic numbers and on Weil's recently established generalization of Mordell's finite basis theorem. Both of these possess a certain non-effective character and thus it is clear that Siegel's argument cannot provide an algorithm for determining all the integer points on the curve. The purpose of the present paper is to establish such an algorithm in the case of curves of genus 1.Keywords
This publication has 4 references indexed in Scilit:
- Construction of rational functions on a curveMathematical Proceedings of the Cambridge Philosophical Society, 1970
- Bounds for the solutions of the hyperelliptic equationMathematical Proceedings of the Cambridge Philosophical Society, 1969
- 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
- Introduction to the Theory of Algebraic Functions of One VariablePublished by American Mathematical Society (AMS) ,1951