Related papers: Diophantine Equations and Congruent Number Equatio…

The original version of this paper did not take into account that there may be solutions (x_0, y_o)in Z X Z of f(x,y) = x^3 + p(y)x + q(y) = 0 even though w_0 = (-3D(y_0))^(1/2) is irrational.

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

The height of a rational number $p/q$ is denoted by $h(p/q)$ and equals $\text{max}(|p|,|q|)$ provided p/q is written in lowest terms. The height of a rational tuple $(x_1,...,x_n)$ is denoted by $h(x_1,...,x_n)$ and equals…

Consider the elliptic curves given by $ E_{n,\theta}:\quad y^2=x^3+2s n x^2-(r^2-s^2) n^2 x $ where $0 < \theta< \pi$, $\cos(\theta)=s/r$ is rational with $0\leq |s| <r$ and $\gcd (r,s)=1$. These elliptic curves are related to the…

Let $1<c<37/18,\,c\neq2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in(N,2N],$ the Diophantine inequality $|p_1^c+p_2^c+p_3^c-R|<\log^{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3.$…

We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…

A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…

In this paper, we refine the method introduced by Izadi and Baghalaghdam to search integer solutions to the Diophantine equation $X_1^5+X_2^5+X_3^5=Y_1^3+Y_2^3+Y_3^3$. We show that the Diophantine equation has infinitely many positive…

A rational Diophantine triple is a set of three nonzero rational a,b,c with the property that ab+1, ac+1, bc+1 are perfect squares. We say that the elliptic curve y^2 = (ax+1)(bx+1)(cx+1) is induced by the triple {a,b,c}. In this paper, we…

Using a recent result of Salberger, we establish the paucity of non-trivial positive integer solutions to a certain system of diagonal Diophantine equations.

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…

In the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…

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…

We shall show that, for any positive integer $D>0$ and any primes $p_1, p_2$ not dividing $D$, the diophantine equation $x^2+D=2^s p_1^k p_2^l$ has at most $63$ integer solutions $(x, k, l, s)$ with $x, k, l\geq 0$ and $s\in \{0, 2\}$.

A set of $m$ distinct nonzero rationals $\{a_1, a_2,\ldots, a_m\}$ such that $a_i a_j+1$ is a perfect square for all $1\le i <j \le m$, is called a rational Diophantine $m$-tuple. If in addition, $a_i^2+1$ is a perfect square for $1\le i\le…

In this paper we find a parametric solution to the hitherto unsolved problem of finding three positive integers such that their sum, the sum of their squares and the sum of their cubes are simultaneously perfect squares.

We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…

We collect a number of open questions concerning Diophantine equations, Diophantine Approximation and transcendental numbers. Revised version: corrected typos and added references.

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…