scientific article; zbMATH DE number 1244310

From MaRDI portal
Publication:4226262





The following interesting theorem is proved. Let \(f(x)\) be a polynomial of degree \(n\) such that \(f\) has at least two distinct zeros, one of which is not rational. Let \(b\) be a rational integer with \(| b| >1\) having \(s\) distinct prime divisors, and denote by \(M\) the Mahler height of \(f\). Then the diophantine equation \(f(x)=b^z \) in integer variables \(x, z\) \((z>1)\) has at most \[ 2n^2 (s+2)+6n^2 (s+1)(ns+n+2) \] solutions provided that \(| b| >c M^{5n}\), where \(c\) is an effectively computable constant depending only on \(n\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226262)