Reverse engineered Diophantine equations

From MaRDI portal



Abstract: We answer a question of Samir Siksek, asked at the open problems session of the conference "Rational Points 2022", which, in a broader sense, can be viewed as a reverse engineering of Diophantine equations. For any finite set S of perfect integer powers, using Mihu{a}ilescu's theorem, we construct a polynomial fSinmathbbZ[x] such that the set fS(mathbbZ) contains a perfect integer power if and only if it belongs to S. We first discuss the easier case where we restrict to all powers with the same exponent. In this case, the constructed polynomials are inspired by Runge's method and Fermat's Last Theorem.



Cites work









This page was built for publication: Reverse engineered Diophantine equations

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