2000 character limit reached
On the Diophantine equations f (x) = g(y)
Published 11 Feb 2019 in math.NT | (1902.03734v1)
Abstract: The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for which the Diophantine equatio (y + q1 )(y + q2 ) .... (y + qm ) = f(x) has finitely many solutions in integers. Also assuming ABC Conjecture, we study the conditions for finiteness of integer solutions of the Diophantine equation f(x) = g(y).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.