Related papers: Diophantine Equations and Congruent Number Equatio…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
In this extended abstract we deal with the relations between the numerical/diophantine approximation and the symbolic/algebraic geometry approachs to solving of multivariate diophentine polynomial systems, obtaining several consecuences…
In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…
New formulae are presented for the number $P(b)$ of non-negative integer solutions of a Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ and for the number $Q(b)$ of non-negative integer solutions of the Diophantine inequality…
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…
We give conditions on the rational numbers a,b,c which imply that there are infinitely many triples (x,y,z) of rational numbers such that x+y+z=a+b+c and xyz=abc. We do the same for the equations x+y+z=a+b+c and x^3+y^3+z^3=a^3+b^3+c^3.…
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$…
We show that for infinitely many square-free integers q there exist infinitely many triples of rational numbers {a, b, c} such that a^2 + q, b^2 + q, c^2 + q, ab + q, ac + q and bc + q are squares of rational numbers.
In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…
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…
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.
Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…
Pythagorean triples are the positive integer solutions to the Pythagoras equation for right triangles, a2+b2 = c2. They have been studied for many years, many centuries in fact. In this short paper we present a method for computing…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
A brief history and two formulations of the Diophantine problem's requirements are presented. One tier consisting of three two-parameter solutions is studied for its ability to provide examples for the small natural numbers considered.…
In this paper we provide a new parametrization for the diophantine equation $A^2+B^2+C^2=3D^2$ and give a series of corollaries. We discuss some connections with Lagrange's four-square theorem. As applications, we find new parameterizations…
Motivated by the recent result of Farhi we show that for each $n\equiv \pm 1\pmod{6}$ the title Diophantine equation has at least two solutions in integers. As a consequence, we get that each (even) perfect number is a sum of three cubes of…
We study $N$-point rational distance sets ($\textrm{RDS}(N)$) on the parabola $y=x^2$. Previous approaches to the problem include efforts made using elliptic curves and diophantine chains, with successful analysis for $N\leq 4$. We extend…
Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…
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…