scientific article; zbMATH DE number 1981157

From MaRDI portal
Publication:4428504





Given a set of simultaneous Diophantine equations \(P_1(x_1,\dots,x_N)=\cdots =P_m(x_1,\dots,x_N)=0\), each with height at most \(H\), under what conditions can one find an effective `search bound' \(S_{M,N}(H)\) such that if the equations have any solution in \(\mathbb{Z}^N\) they have one with new \(|x_i|\leq S_{M,N}(H)\)? This survey paper describes the solutions to this problem in the case of a single quadratic equation, due to \textit{R. Dietman} [Proc. Lond. Math. Soc., III. Ser. 86, No.~3, 545--582 (2003; Zbl 1036.11009)], and makes a number of interesting observations about the general problem. In particular it is asked whether the equation \[ x^4-2y^4+xy+x=2000 \] has any integer solutions. For the entire collection see [Zbl 0997.00017].











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 Q4428504)