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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.