相关论文: Diophantine Equations of Matching Games I

This paper reports on the current status of the project in which we order all polynomial Diophantine equations by an appropriate version of "size", and then solve the equations in that order. We list the "smallest" equations that are…

In this article we establish two new results on quantitative Diophantine approximation for one-parameter families of diagonal ternary indefinite forms. In the first result, we consider quadratic forms taking values at prime points. In the…

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…

This paper collects polynomial Diophantine equations that are simple to state but apparently difficult to solve.

To give a parametrization of the Diophantine equation $A^{3}+B^{3}=C^{3}+D^{3}$ in terms of integral binary quadratic forms in a constructive way.

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…

We show how to reduce the problem of solving members of a certain family of nonlinear differential equations to that of solving some corresponding linear differential equations.

This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…

In [1] it is shown that the Diophantine equation $(k!)^n+k^n=(n!)^k+n^k$ only has the trivial solution $n=k$, and $(k!)^n-k^n=(n!)^k-n^k$ only has the solutions $n=k$, $(n, k)=(1, 2),$ and $(2, 1)$. In this article we find all solutions of…

Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.

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…

We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine…

In this paper we propose a method of solving a Nonlinear Diophantine Equation by converting it into a System of Diophantine Linear Equations.

In this paper, we summarize the work on ternary Diophantine equation of the form $Ax^n+By^n=cz^m$, where $m \in \{2,3,n\} $, $n\geqslant 7 $ is a prime. Moreover, we completely solve some particular cases ($A=5^{\alpha}, ~B=64,~ c=3, ~m=2;…

In this paper we give solutions of certain diophantine equations related to triangular and tetrahedral numbers and propose several problems connected with these numbers. The material of this paper was presented in part at the 11th…

The families of simplest cubic, simplest quartic and simplest sextic fields and the related Thue equations are well known. The family of simplest cubic Thue equations was already studied in the relative case, over imaginary quadratic…

We give criteria of the solvability of the diophantine equation $p=x^2+ny^2$ over some imaginary quadratic fields where $p$ is a prime element. The criteria becomes quite simple in special cases.