On the Diophantine equation \(y^p=\frac{f(x)}{g(x)}\) (Q2416447)

Let \(f\), \(g\) be monic polynomials with integer coefficients and \(p\) be a prime. The authors prove that under some conditions, the equation \(y^p=\frac{f(x)}{g(x)}\) allows only finitely many solutions in \(x\in\mathbb Z\), \(y\in\mathbb Q$; in fact the main result implies an upper bound for \(\vert x\vert\). The main tool in the proof is a certain Runge type argument. This new theorem extends several recent results from the literature.