Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Baker et al. (1970) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: