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 simultaneous equations of degrees four and six in six variables. The method of solving these homogeneous equations also simultaneously yields arbitrarily many rational solutions of certain related nonhomogeneous equations of high degree. In contrast to existing methods, we obtain the arbitrarily large number of solutions without finding a parametric solution of the equations under consideration and without relating the solutions to rational points on an elliptic curve of positive rank. It appears from the examples given in the paper that there may exist projective varieties on which there are an arbitrarily large number of integer points and on which a curve of genus 0 or 1 does not exist.
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.
We are interested in solving the congruences $f^3+g^3+1\equiv 0\pmod{fg}$ and $f^4-4g^2+4\equiv 0\pmod{fg}$ in polynomials $f, g$ with rational coefficients. Moreover, we present results of computations of all integer points on certain one parametric curves of genus 1 and 3, related to cubic and quartic fields, respectively.
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.
In this paper, we use the method of Thue and Siegel, based on explicit Pade approximations to algebraic functions, to completely solve a family of quartic Thue equations. From this result, we can also solve the diophantine equation in the title. We prove that this equation has at most one solution in positive integers when $d \geq 3$. Moreover, when such a solution exists, it is of the form $(u,\sqrt{v})$ where $(u,v)$ is the fundamental solution of $X^{2}+1=dY^{2}$.
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-α^2)(x^2-(α+1)^2).$ We express their integer solutions by means of the divisors of the discriminant of $f(x),$ where $y^2=f(x)$.
Quartic Rational Diophantine Quadruples and the Euler Surface
University of Zagreb, Faculty of Civil Engineering（萨格勒布大学土木工程学院）；University of Zagreb, Faculty of Science（萨格勒布大学理学院）；University of Zagreb Faculty of Electrical Engineering and Computing（萨格勒布大学电气工程和计算学院）
In this paper we first show that, under certain conditions, the solution of a single quadratic diophantine equation in four variables $Q(x_1,\,x_2,\,x_3,\,x_4)=0$ can be expressed in terms of bilinear forms in four parameters. We use this result to establish a necessary, though not sufficient, condition for the solvability of the simultaneous quadratic diophantine equations $Q_j(x_1,\,x_2,\,x_3,\,x_4)=0,\;j=1,\,2,$ and give a method of obtaining their complete solution. In general, when these two equations have a rational solution, they represent an elliptic curve but we show that there are se…
The Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been investigated by some authors. Currently, by computer search, the integer solutions of this equation are known for all positive integer values of $h \le 5000$ and $A, B, C, D \le 100000$, except for some numbers, while a solution of this Diophantine equation is not known for arbitrary positive integer values of $h$. Gerardin and Piezas found solutions of this equation when $h$ is given by polynomials of degrees $5$ and $2$ respectively. Also Choudhry presented some new solutions of this equat…
While Roth's theorem states that the irrationality measure of all the irrational algebraic numbers is 2, and the same holds true over function fields in characteristic zero, some counter-examples were found over function fields in positive characteristic. This was put forward first by Mahler in 1949, in his fundamental paper on Diophantine approximation \cite{M}. It seems that, except for particular elements, as power series with bounded partial quotients, Roth's theorem holds. Until now, only one element, with unbounded partial quotients, discovered by Mills and Robbins \cite{MR} in 1986, has…
In this paper we consider Diophantine equation x4 + y4 = z4 + w4 (1)We construct some family of cubic curves.We prove that every rational point on Quar- tica x4 + y4 = z4 + w4 can be mapped to a point on some curve of this family. We also prove the opposite: each rational point belonging to our family of curves can be mapped to a rational point on the Quartica. (2) We find the point on our family of curves corresponding to a parametric solution of Leonard Euler. We construct several new parametric solutions of our Quartica, using a parametric solution of Leonard Euler and the algebraic operati…
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
Let $C$ be a smooth genus one curve described by a quartic polynomial equation over the rational field $\mathbb Q$ with $P\in C(\mathbb Q)$. We give an explicit criterion for the divisibility-by-$2$ of a rational point on the elliptic curve $(C,P)$. This provides an analogue to the classical criterion of the divisibility-by-$2$ on elliptic curves described by Weierstrass equations. We employ this criterion to investigate the question of extending a rational $D(q)$-quadruple to a quintuple. We give concrete examples to which we can give an affirmative answer. One of these results implies that a…
Some upper bounds for the number of monogenizations of quartic orders are established by considering certain classical Diophantine equations, namely index form equations in quartic number fields, and cubic and quartic Thue equations.
We give a method to solve generalized Fermat equations of type $x^4 + y^4 = q z^p$, for some prime values of $q$ and every prime $p$ bigger than 13. We illustrate the method by proving that there are no solutions for $q= 73, 89$ and 113.
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.
In this paper, we study the algebraic points of degree $4$ over $\mathbb{Q}$ on the Fermat curve $F_5/\mathbb{Q}$ of equation $x^5+y^5+z^5=0$. A geometrical description of these points has been given in 1997 by Klassen and Tzermias. Using their result, as well as Bruin's work about diophantine equations of signature $(5,5,2)$, we give here an algebraic description of these points. In particular, we prove there is only one Galois extension of $\mathbb{Q}$ of degree $4$ that arises as the field of definition of a non-trivial point of $F_5$.
Let $α$ be an algebraic number of degree $d\ge 3$ and let $K$ be the algebraic number field $\Q(α)$. When $\varepsilon$ is a unit of $K$ such that $\Q(α\varepsilon)=K$, we consider the irreducible polynomial $f_\varepsilon(X) \in \Z[X]$ such that $f_\varepsilon(α\varepsilon)=0$. Let $F_\varepsilon(X,Y)$ be the irrreducible binary form of degree $d$ associated to $f_{\varepsilon}(X) $ under the condition $F_{\varepsilon}(X,1)=f_{\varepsilon}(X)$. For each positive integer $m$, we want to exhibit an effective upper bound for the solutions $(x,y,\varepsilon)$ of the diophantine inequation $|F_\va…
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.
In our notice we propose the classification of some quartic equations with only trivial solutions by the auxiliary equations. For proving trivial solutions of the quartic equations we use method infinite descent based on the number of prime integers of the solution of the auxiliary equation. The quartic equations with only trivial solutions belong to "higher arithmetic". The main tools of their investigation are the fundamental theorem of arithmetic, infinite descent and elliptic curves. In 1969, L.J. Mordell has observed that the triviality of the solution of $x^4 + y^4 = 2z^2$ implies the tr…
Solutions of the quartic Fermat equation in ring class fields of odd conductor over quadratic fields $K=\mathbb{Q}(\sqrt{-d})$ with $-d \equiv 1$ (mod $8$) are shown to be periodic points of a fixed algebraic function $T(z)$ defined on the punctured disk $0< |z|_2 \le \frac{1}{2}$ of the maximal unramified, algebraic extension $\textsf{K}_2$ of the $2$-adic field $\mathbb{Q}_2$. All ring class fields of odd conductor over imaginary quadratic fields in which the prime $p=2$ splits are shown to be generated by complex periodic points of the algebraic function $T$, and conversely, all but two of …
In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are fixed arbitrary nonzero integers. By our method, we may find infinitely many nontrivial positive solutions and also obtain infinitely many nontrivial parametric solutions for the Diophantine equations for every arbitrary integers $n$, $m$, $a_i$ and $b_i$.
Gallagher's theorem is a sharpening and extension of the Littlewood conjecture that holds for almost all tuples of real numbers. We provide a fibre refinement, solving a problem posed by Beresnevich, Haynes and Velani in 2015. Hitherto, this was only known on the plane, as previous approaches relied heavily on the theory of continued fractions. Using reduced successive minima in lieu of continued fractions, we develop the structural theory of Bohr sets of arbitrary rank, in the context of diophantine approximation. In addition, we generalise the theory and result to the inhomogeneous setting. …
In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform each case of the above Diophantine equations to a cubic elliptic curve of positive rank, then get infinitely many integer solutions for each case. We also solve these Diophantine equations for some values of n, a, a_i, t_i, and obtain infinitely many solutions for each case, and show among the other things that how sums of four, five, or more cubics can be wr…
Polyhedral Omega is a new algorithm for solving linear Diophantine systems (LDS), i.e., for computing a multivariate rational function representation of the set of all non-negative integer solutions to a system of linear equations and inequalities. Polyhedral Omega combines methods from partition analysis with methods from polyhedral geometry. In particular, we combine MacMahon's iterative approach based on the Omega operator and explicit formulas for its evaluation with geometric tools such as Brion decompositions and Barvinok's short rational function representations. In this way, we connect…
In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$ being $3,\,4,\,6$ or $8$), and $x_i,\,y_i,\;i=1,\,2,\,\ldots,\,n$, are independent variables while the values of $z_i,\;i=1,\,2,\,\ldots,\,n$, are given by bilinear forms in the variables $x_i,\,y_i$. When $n=2,\,4$ or $8$, we also obtain composition identities $f(x_i)f(y_i)f(z_i)=f(w_i)$ where, as before, $f(x_i)$ is an irreducible form, with integer coeffici…
In this paper, by using the elliptic curves theory, we study the fourth power Diophantine equation ${ \sum_{i=1}^n a_ix_{i} ^4= \sum_{j=1}^na_j y_{j}^4 }$, where $a_i$ and $n\geq3$ are fixed arbitrary integers. We solve the equation for some values of $a_i$ and $n=3,4$, and find nontrivial solutions for each case in natural numbers. By our method, we may find infinitely many nontrivial solutions for the above Diophantine equation and show, among the other things, that how some numbers can be written as sums of three, four, or more biquadrates in two different ways. While our method can be used…
In Ramanujan's Lost Notebook there is an amazing identity that furnishes infinitely many "almost counterexamples" to the cubic Fermat's Last Theorem, with no indication whatsoever how he discovered it. In 1995, Michael Hirschhorn explained, in a brilliant way, how Ramanujan may have done it, based on a certain polynomial identity for a sum of four cubes. Much earlier, Eri Jabotinsky, in an article published in 1946 (in a mathematics journal for teenagers) explained how Ramanujan may have discovered these polynomial identities needed for Hirschhorn's approach. Here we combine these two brillian…
We solve the Diophantine equations $x^5 + y^5 = dz^p$ with $d=2, 3$ for a set of prime numbers of density 1/4, 1/2, respectively. The method consists in relating a possible solution to another Diophantine equation and solving the later by using Q-curves and a generalized modular technique as in work of Ellenberg and Dieulefait-Jimenez along with some new techniques for eliminating newforms.
We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by Ellenberg in the solution of the equation x^4 + y^2 = z^p, and we use Q-curves, modular forms and inner twists. In principle our method can be applied to solve this type of equations for other values of d.
In this paper, by solving Diophantine equations involving simple $K_4$-groups, we will try to point out that it is not easy to prove the infinitude of simple $K_4$-groups. This problem goes far beyond what is known about Dickson's conjecture at present.
Let $α$ be an algebraic number of degree $d\ge 3$ having at most one real conjugate and let $K$ be the algebraic number field ${\mathbf Q}(α)$. For any unit $ε$ of $K$ such that ${\mathbf Q}(αε)=K$, we consider the irreducible polynomial $f_ε(X)\in{\mathbf Z}[X]$ such that $f_ε(αε)=0$. Let $F_ε(X,Y)\ = Y^df_ε(X/Y)\in{\mathbf Z}[X,Y]$ be the associated binary form. For each positive integer $m$, we exhibit an effectively computable bound for the solutions $(x,y,ε)$ of the diophantine equation $|F_ε(x,y)|\leq m$.
We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $Ω$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $Ω$ to determining whether a certain Diophantine equation with two parameters, $k$ and $N$, has solutions for an odd or an even number of values of $N$. We also demonstrate two further examples of $Ω$ in number theory: an exponential Diophantine equation with a parameter $k$ which has an odd number of solutions iff the $k$-th bit of $Ω$ is 1, and a polynomial of positive integer variabl…
In our recent paper we gave an efficient algorithm to calculate "small" solutions of relative Thue equations (where "small" means an upper bound of type $10^{500}$ for the sizes of solutions). Here we apply this algorithm to calculating power integral bases in sextic fields with an imaginary quadratic subfield and to calculating relative power integral bases in pure quartic extensions of imaginary quadratic fields. In both cases the crucial point of the calculation is the resolution of a relative Thue equation. We produce numerical data that were not known before.
In the first part we construct algorithms which we apply to solve S-unit, Mordell, cubic Thue, cubic Thue-Mahler and generalized Ramanujan-Nagell equations. As a byproduct we obtain alternative practical approaches for various classical Diophantine problems, including the fundamental problem of finding all elliptic curves over Q with good reduction outside a given finite set of rational primes. To illustrate the utility of our algorithms we determined the solutions of large classes of equations, containing many examples of interest which are out of reach for the known methods. In addition we u…
We are interested in solving decision problem $\exists? t \in \mathbb{N}, \cos t θ= c$ where $\cos θ$ and $c$ are algebraic numbers. We call this the $\cos t θ$ problem. This is an exploration of Diophantine equations with analytic functions. Polynomial, exponential with real base and cosine function are closely related to this decision problem: $ \exists ? t \in \mathbb{N}, u^T M^t v = 0$ where $u, v \in \mathbb{Q}^n, M \in \mathbb{Q}^{n\times n}$. This problem is also known as "Skolem problem" and is useful in verification of linear systems. Its decidability remains unknown. Single variable …
We describe an algorithmic reduction of the search for integral points on a curve y^2 = ax^4 + bx^2 + c with nonzero ac(b^2-4ac) to solving a finite number of Thue equations. While existence of such reduction is anticipated from arguments of algebraic number theory, our algorithm is elementary and to best of our knowledge is the first published algorithm of this kind. In combination with other methods and powered by existing software Thue equations solvers, it allows one to efficiently compute integral points on biquadratic curves. We illustrate this approach with a particular application of f…
