Reverse Engineered Diophantine Equations over Q

Abstract

Let PQ=\ αn \; : \; α ∈ Q, \; n 2\ be the set of rational perfect powers, and let S ⊂eq PQ be a finite subset. We prove the existence of a polynomial fS ∈ Z[X] such that f(Q) PQ=S. This generalizes a recent theorem of Gajovi\'c who recently proved a similar theorem for finite subsets of integer perfect powers. Our approach makes use of the resolution of the generalized Fermat equation of signature (2,4,n) due to Ellenberg and others, as well as the finiteness of perfect powers in non-degenerate binary recurrence sequences, proved by Petho and by Shorey and Stewart.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…