Diophantine equations in two variables

Diophantine equations in separated variables and lacunary polynomials

We study Diophantine equations of type $f(x)=g(y)$, where $f$ and $g$ are lacunary polynomials. According to a well known finiteness criterion, for a number field $K$ and nonconstant $f, g\in K[x]$, the equation $f(x)=g(y)$ has infinitely many solutions in $S$-integers $x, y$ only if $f$ and $g$ are representable as a functional composition of lower degree polynomials in a certain prescribed way. The behaviour of lacunary polynomials with respect to functional composition is a topic of independent interest, and has been studied by several authors. In this paper we utilize known results and dev…

A new method of solving quartic and higher degree diophantine equations

In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine equations, in five or more variables, with one of the equations being of degree $\geq 4$. We show that, under certain conditions, the method yields an arbitrarily large number of integer solutions of such diophantine equations and diophantine systems, some examples being a sextic equation in four variables, a tenth degree equation in six variables, and two simul…

Diophantine Equation $X^4+Y^4=2(U^4+V^4)$

In this paper, the theory of elliptic curves is used for finding the solutions of the quartic Diophantine equation $X^4+Y^4=2(U^4+V^4)$ Keywords: Diophantine equation, Elliptic curve, Congruent number

Integer conversions and estimation of the number of integer solutions of algebraic Diophantine equations

The paper assesses the top number of integer solutions for algebraic Diophantine Thue diagonal equation of the degree $n \geq 2$ and number of variables $k > 2$ and equations with explicit variable in the case when the coefficients of the equation are of the opposite signs. The author found integer conversions that maintain the asymptotic behavior of the number of integer solutions of algebraic Diophantine equation in the case of the conversion equation to diagonal form. The paper considers the estimation of the number of integer solutions for some types of algebraic Diophantine equations with…

Estimating of the number of natural solutions of homogeneous algebraic Diophantine diagonal equations with integer coefficients

Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer coefficients. It was found the lower estimate of the number of natural solutions to various types of homogeneous algebraic Diophantine equations with integer coefficients diagonal form with any number of variables using this method. Author obtained upper bound of the number of the natural solutions (using CM) of one type of homogeneous Diophantine equation for val…

The Diophantine equation xy=z^n; for n=2,3,4,5,6; the Diophantine equation xyz=w^2; and the Diophantine system: xy=v^2 and yz=w^2

In this work, we accomplish three goals. First, we determine the entire family of positive integer solutions to the three- variable Diophantine equation, xy=z^2; for n=2,3,4,5,6. For n=2, we obtain a 3-parameter family of solutions; for n=3, a 5-parameter of solutions; likewise for n=4. For n=5, a 7-parameter family of solutions; and likewise for n=6. See Theorems 2 through 6 respectively. The second goal of this paper, is determining all the positive integer solutions of xyz=w^2. This is done in Theorem7; the solution set is described in terms of six independent parameters. Finally, in Theore…

Diophantine Equations Involving the Euler Totient Function

We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.

On the Diophantine equation F_{n}-F_{m}=2^{a}

In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in diophantine approximation.

Diophantine equations in moderately many variables

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by generalising an approach due to Heath-Brown, using a certain $q$-analogue of van der Corput's method, to the case of systems of polynomials of differing degree. Our results apply for a wider range of $n$, in terms of the degrees of the polynomials $f_i$, than bounds obtained with the circle method.

An implementation of Runge's method for Diophantine equations

In this paper we suggest an implementation of Runge's method for solving Diophantine equations satisfying Runge's condition. In this implementation we avoid the use of Puiseux series and algebraic coefficients.

On a diophantine equation of M. J. Karama

For every positive integer $n$, an infinite family of positive integral solutions of the diophantine equation $x^n - y^n = z^{n+1}$ is constructed.

Quantitative indicators of the solutions of Diophantine equations and systems in the domain of the natural numbers

The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be the solution of the algebraic equations of the first, second and higher orders in two or more variables, non-algebraic Diophantine equations and systems of Diophantine equations in the domain of the natural numbers. The estimate for the number of positive integer solutions of the second-order Diophantine equations in two, three or more variables is geometri…

Quantitative Results on Diophantine Equations in Many Variables

We consider a system of integer polynomials of the same degree with non-singular local zeros and in many variables. Generalising the work of Birch (1962) we find quantitative asymptotics (in terms of the maximum of the absolute value of the coefficients of these polynomials) for the number of integer zeros of this system within a growing box. Using a quantitative version of the Nullstellensatz, we obtain a quantitative strong approximation result, i.e. an upper bound on the smallest integer zero provided the system of polynomials is non-singular.

Some remarks on diophantine equations and diophantine approximation

We first recall the connection, going back to A. Thue, between rational approximation to algebraic numbers and integer solutions of some Diophantine equations. Next we recall the equivalence between several finiteness results on various Diophantine equations. We also give many equivalent statements of Mahler's generalization of the fundamental theorem of Thue. In particular, we show that the theorem of Thue--Mahler for degree $3$ implies the theorem of Thue--Mahler for arbitrary degree $\ge3$, and we relate it with a theorem of Siegel on the rational integral points of the projective line $¶^1…

A new diophantine equation involving fifth powers

In this paper we obtain a parametric solution of the hitherto unsolved diophantine equation $(x_1^5+x_2^5)(x_3^5+x_4^5)=(y_1^5+y_2^5)(y_3^5+y_4^5)$. Further, we show, using elliptic curves, that there exist infinitely many parametric solutions of the aforementioned diophantine equation, and they can be effectively computed.

On a Kind of Nonlinear Diophantine Equation

In this paper we show a way to generalize the linear Diophantine equation a1x1+a2x2+...+anxn=d . We deal with the nonlinear Diophantine equation det|A X|=+-d , which generalizes the linear one, and we give a necessary and sufficient condition for its solvabiliy. We show how the linear equation can be considered as a particular case of the nonlinear equation.

Estimating of the number of integer (natural) solutions of inhomogeneous algebraic Diophantine diagonal equations with integer coefficients

This paper investigates the upper bound of the number of integer (natural) solutions of inhomogeneous algebraic Diophantine diagonal equations with integer coefficients without a free member via the circle method of Hardy and Littlewood. Author found the upper bound of the number of natural solutions of inhomogeneous algebraic Diophantine diagonal equations with explicit variable. He developed a method in the paper, which allows you to perform the low estimate of the number of natural (integer) solutions of algebraic Diophantine equation with integer coefficients. Author obtained a lower estim…

On the Diophantine equations f (x) = g(y)

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for which the Diophantine equatio (y + q1 )(y + q2 ) .... (y + qm ) = f(x) has finitely many solutions in integers. Also assuming ABC Conjecture, we study the conditions for finiteness of integer solutions of the Diophantine equation f(x) = g(y).

Note on the diophantine equation X^t+Y^t=BZ^t

In this paper, we obtain new results on the integers solutions X, Y, Z of the diophantine equation X^t+Y^t=BZ^t for a rationnal integer B and a prime number t verifying some conditions explained in the paper.

On the Diophantine Equation $p^x + p^y = z^{2n}$

In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation $p^x + p^y = z^2$ for a prime number $p$. In that paper they find some solutions to the equation for $p=2, 3$. In this paper, we look at a general version of this equation and solve it completely.

A diophantine equation for sums of consecutive like powers

We show that the diophantine equation $n^\ell+(n+1)^\ell + ...+ (n+k)^\ell=(n+k+1)^\ell+ ...+ (n+2k)^\ell$ has no solutions in positive integers $k,n \ge 1$ for all $\ell \ge 3$.

About the Diophantine Equation $x^{4}-q^{4}=py^{r}$

In this paper, we prove a theorem about the integer solutions to the Diophantine equation $x^{4}-q^{4}=py^{r}$, extending previous work of K.Gy\H ory, and F.Luca and A.Togbe, and of the author.

Classical and modular approaches to exponential Diophantine equations II. The Lebesgue-Nagell equation

We solve completely the Lebesgue-Nagell equation x^2+D=y^n, in integers x, y, n>2, for D in the range 1 =< D =< 100.

On solutions of the Diophantine equation $\mathcal{P}_m-L_n=c$

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine equation. The proof of our main theorem uses lower bounds for linear forms of logarithms, properties of continued fractions, and a version of the Baker-Davenport reduction method in Diophantine approximation.

On the Diophantine equation $f(x)=2f(y)$

Let $f(x)=x^{2}(x^{2}-1)(x^{2}-2)(x^{2}-3).$ We prove that the Diophantine equation $ f(x)=2f(y)$ has no solutions in positive integers $x$ and $y$, except $(x, y)=(1, 1)$.

一个关于 $\mathbb Z[i]$ 上丢番图方程 18 变量不可判定性的 AI 证明

An AI Proof of 18-Variable Undecidability for Diophantine Equations over $\mathbb Z[i]$

本文通过 AI 证明，在高斯整数环上，不存在算法判定 18 个未知数的多项式方程是否有解，将 Matiyasevich 和 Sun 的 20 变量定理改进为 18 变量。

On the Diophantine equation cy^l=(x^p-1)/(x-1)

Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions

全实域上丢番图方程的模方法

The modular approach to Diophantine equations over totally real fields

本文综述了将Wiles证明Fermat大定理的模方法推广至全实数域上丢番图方程时所面临的新障碍，并调查了该领域现有的方法与结果。

A Hasse-type principle for exponential diophantine equations and its applications

We propose a conjecture, similar to Skolem's conjecture, on a Hasse-type principle for exponential diophantine equations. We prove that in a sense the principle is valid for "almost all" equations. Based upon this we propose a general method for the solution of exponential diophantine equations. Using a generalization of a result of Erdős, Pomerance and Schmutz concerning Carmichael's $λ$ function, we can make our search systematic for certain moduli needed in the method.

A quartic diophantine equation inspired by Brahmagupta's identity

In this paper we obtain several parametric solutions of the quartic diophantine equation $(x_1^4+x_2^4)(y_1^4+y_2^4)=z_1^4+z_2^4$. We also show how infinitely many parametric solutions of this equation may be obtained by using elliptic curves.

On the Exponential Diophantine Equation $(F_{m+1}^{(k)})^x-(F_{m-1}^{(k)})^x = F_n^{(k)}$

In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in Diophantine approximation, due to Dujella and Pethö. This paper extends the previous work of \cite{Patel}.

An equivalent condition for the Markov triples and the Diophantine equation $a^2+b^2+c^2=abcf(a,b,c)$

We propose an equivalent condition for the Markov triples, which was mentioned by H. Rademacher essentially. As an application, we study the solvability of the Diophantine equation $a^2+b^2+c^2=abcf(a,b,c)$.

Functional composition of polynomials: indecomposability, Diophantine equations and lacunary polynomials

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the study of decompositions of lacunary polynomials and the finiteness criterion for the equations of type f(x) = g(y).

A Mean Value Theorem for the Diophantine Equation $axy-x-y=n$

In this paper, we prove an asymptotic formula for the average number of solutions to the Diophantine equation $axy-x-y=n$ in which $a$ is fixed and and $n$ varies.

On the Diophantine Equation X2+19M=YN

In this article, we consider the equation x^2+19^{m}=y^n, n>2, m>0. We find the solutions of the title equation for not only 2 \mid m but also 2\notdividesm.

On the Diophantine equation in the form that a sum of cubes equals a sum of quintics

We show how sums of some $5th$ powers can be written as sums of some cubics

An exponential Diophantine equation related to the difference between powers of two consecutive Balancing numbers

In this paper, we find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.

The Diophantine Equation x^{2}+11^{m}=y^{n}

The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.

A Note on the Quartic Diophantine Equation $A^4+hB^4=C^4+hD^4$

Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not known, Gerardin and Piezas found solutions of this equation when $h$ is given by polynomials of degrees 5 and 2 respectively. In this paper, we present several new solutions of this equation when $h$ is given by polynomials of degrees $2,\;3$ and 4.

Converting of algebraic Diophantine equations to a diagonal form with the help of an integer non-orthogonal transformation, maintaining the asymptotic behavior of the number of its integer solutions

The author showed that any homogeneous algebraic Diophantine equation of the second order can be converted to a diagonal form using an integer non-orthogonal transformation maintaining asymptotic behavior of the number of its integer solutions. In this paper, we consider the transformation to the diagonal form of a wider class of algebraic second-order Diophantine equations, and also we consider the conditions for converting higher order algebraic Diophantine equations to this form. The author found an asymptotic estimate for the number of integer solutions of the diagonal Thue equation of odd…

A Survey on the Ternary Purely Exponential Diophantine Equation $a^x + b^y = c^z$

Let $a$, $b$, $c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this survey, we consider some unsolved problems and related works concerning the positive integer solutions $(x,y,z)$ of the ternary purely exponential diophantine equation $a^x + b^y = c^z$.

On an infinite number of solutions to the Diophantine equation $ x^{n}+y^{p}=z^{q}$ over the square integer matrices

In this paper, we use some extension of the Cayley-Hamilton theorem to find a family of matrices with integer entries that satisfy the non-linear Diophantine equation $ x^{n}+y^{p}=z^{q}$ where $n,p$ and $q$ are arbitrary positive integers.

On the Diophantine equation $pq=x^2+ny^2$

Let $n$ be a positive integer. We discuss pairs of distinct odd primes $p$ and $q$ not dividing $n$ for which the Diophantine equations $pq=x^2+ny^2$ have integer solutions in $x$ and $y$. As its examples we classify all such pairs of $p$ and $q$ when $n=5$ and $14$.

A p-adic look at the Diophantine equation x^{2}+11^{2k}=y^{n}

We find all solutions of Diophantine equation x^{2}+11^{2k} = y^{n} where x>=1, y>=1, n>=3 and k is natural number. We give p-adic interpretation of this equation.

Random diophantine equations of additive type

Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true. Moreover, our approach shows that almost all such equations having a non-trivial integer solution have a very small such solution, the bound being close to the best possible one.

关于四次丢番图方程 $X^4-Y^4=R^2-S^2$ 的一个注记

A Note on Quartic Diophantine equation $X^4-Y^4=R^2-S^2$

本文研究四次丢番图方程 $X^4-Y^4=R^2-S^2$，主要贡献是构造并证明了该方程具有无穷多个整数解。

Integral solutions of certain Diophantine equation in quadratic fields

Let $K= \mathbf{Q}(\sqrt{d})$ be a quadratic field and $\mathcal{O}_{K}$ be its ring of integers. We study the solvability of the Diophantine equation $r + s + t = rst = 2$ in $\mathcal{O}_{K}$. We prove that except for $d= -7, -1, 17$ and $101$ this system is not solvable in the ring of integers of other quadratic fields.

On the Diophantine equation $f(x)f(y)=f(z)^n$ involving Laurent polynomials

By the theory of elliptic curves, we investigate the nontrivial rational parametric solutions of the Diophantine equation $f(x)f(y)=f(z)^n$, where $n=1,2$ and $f(X)$ are some simple Laurent polynomials.

On the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ concerning Laurent polynomials

By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ for some simple Laurent polynomials $f$ and $g$.

On the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5

We prove that for each odd prime p, positive integer alpha, and non-negative integers beta and gamma, the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5 has no solution with X, Z, N in Z^+, N > 1, and gcd(X,Z) = 1.

广义水果丢番图方程与超椭圆曲线

Generalized fruit Diophantine equation and super elliptic curves

本文研究特定超椭圆曲线上的有理点，通过广义水果丢番图方程探讨其解的存在性与结构。

On the Non-negative Integer Solutions to Diophantine Equations $F_n - F_m = 7^a$ and $F_n - F_m = 13^a$

In this paper, we study the solutions of the equation $F_n-F_m=p^a$ where $p$ is either $7$ or $13$ and $n>m\geqslant 0$, $a\geqslant 2$. We confirm the conjecture of Erduvan and Keskin by proving that there is no solutions for this Diophantine equation. We will use the lower bounds for linear forms in logarithms (Baker's theory) and a version of the Baker-Davenport reduction method in Diophantine approximation.

Solving Quadratic and Cubic Diophantine Equations using 2-adic Valuation Trees

For fixed integers $D \geq 0$ and $c \geq 3$, we demonstrate how to use $2$-adic valuation trees of sequences to analyze Diophantine equations of the form $x^2+D=2^cy$ and $x^3+D=2^cy$, for $y$ odd. Further, we show for what values $D \in \mathbb{Z}^+$, the numbers $x^3+D$ will generate infinite valuation trees, which lead to infinite solutions to the above Diophantine equations.

On the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ involving Laurent polynomials

By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.