On decompositions of quadrinomials and related Diophantine equations

preprint2015arXivOpen access

Abstract

Let A,B,C,DA,B,C,D be rational numbers such that ABC≠0ABC \neq 0, and let n1>n2>n3>0n_1>n_2>n_3>0 be positive integers. We solve the equation Axn1+Bxn2+Cxn3+D=f(g(x)), Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)), in f,g∈Q[x]f,g \in \mathbb{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, Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = Ey^{m_1}+Fy^{m_2}+Gy^{m_3}+H, where A,B,C,D,E,F,G,HA,B,C,D,E,F,G,H are rational numbers ABCEFG≠0ABCEFG \neq 0 and n1>n2>n3>0n_1>n_2>n_3>0, m1>m2>m3>0m_1>m_2>m_3>0, gcd⁡(n1,n2,n3)=gcd⁡(m1,m2,m3)=1\gcd(n_1,n_2,n_3) = \gcd(m_1,m_2,m_3)=1 and n1,m1≥9n_1,m_1 \geq 9. And the equation A1xn1+A2xn2+…+Alxnl+Al+1=Eym1+Fym2+Gym3, A_1x^{n_1}+A_2x^{n_2}+\ldots+A_l x^{n_l} + A_{l+1} = Ey^{m_1}+Fy^{m_2}+Gy^{m_3}, where l≥4l \geq 4 is fixed integer, A1,…,Al+1,E,F,GA_1,\ldots,A_{l+1},E,F,G are non-zero rational numbers, except for possibly Al+1A_{l+1}, n1>n2>…>nl>0n_1>n_2>\ldots > n_l>0, m1>m2>m3>0m_1>m_2>m_3>0 are positive integers such that gcd⁡(n1,n2,…nl)=gcd⁡(m1,m2,m3)=1\gcd(n_1,n_2, \ldots n_l) = \gcd(m_1,m_2,m_3)=1, and n1≥4n_1 \geq 4, m1≥2l(l−1)m_1 \geq 2l(l-1).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.