On decompositions of quadrinomials and related Diophantine equations
Abstract
Let A,B,C,D be rational numbers such that ABC ≠ 0, and let n1>n2>n3>0 be positive integers. We solve the equation Axn1+Bxn2+Cxn3+D = f(g(x)), in f,g ∈ Q[x]. In sequel we use Bilu-Tichy method to prove finitness of integral solutions of the equations Axn1+Bxn2+Cxn3+D = Eym1+Fym2+Gym3+H, where A,B,C,D,E,F,G,H are rational numbers ABCEFG ≠ 0 and n1>n2>n3>0, m1>m2>m3>0, (n1,n2,n3) = (m1,m2,m3)=1 and n1,m1 ≥ 9. And the equation A1xn1+A2xn2+…+Al xnl + Al+1 = Eym1+Fym2+Gym3, where l ≥ 4 is fixed integer, A1,…,Al+1,E,F,G are non-zero rational numbers, except for possibly Al+1, n1>n2>… > nl>0, m1>m2>m3>0 are positive integers such that (n1,n2, … nl) = (m1,m2,m3)=1, and n1 ≥ 4, m1 ≥ 2l(l-1).
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.