Cubic Thue Equations
classification
🧮 math.NT
keywords
cubicthuebinarydiscriminantenoughequationequationsevery
read the original abstract
We revisit a work by R. Okazaki and prove that for every cubic binary form F(x, y) with large enough discriminant, the Thue equation |F(x, y)| = 1 has at most 7 solutions in integers x and y.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.