Related papers: Construction of Bhaskara Pairs
We give the complete solution in integers $(n,a,b,x,y)$ of the title equation when $\gcd(x,y)=1$, except for the case when $xab$ is odd.
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.
We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…
In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…
In this paper, we solve the simultaneous Diophantine equations(SDE) x_1^u+...+x_n^u=k(y_1^u+...+y_{n/k}); u=1,3, where n >3, and k< n, is a divisor of n , and obtain nontrivial parametric solution for them. Furthermore we present a method…
In this article the Diophantine equations of the form $x^{2}-8C_{n}xy+ 16y^{2}=\pm2^{r}$, $x^{4}-8C_{n}x^{2}y+ 16y^{2}=\pm2^{r}$ and $x^{2}-8C_{n}xy^{2}+ 16y^{4}=\pm2^{r}$ are taken into consideration for the investigations of existence of…
We investigate pairs of diagonal cubic equations with integral coefficients. For a class of such Diophantine systems with 11 or more variables, we are able to establish that the number of integral solutions in a large box is at least as…
The subject matter of this work are the linear, three variable diophantine equation ax+by+cz=d (1), and the diophantine system ax+by+cz=d (2) ex+fy+gz=h with the coefficients a,b,c,d,e,f,g,h being integers. Introductory number theory books,…
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…
We develop an algebraic method of studying of Diophantine quadratic equations in three variables over the ring of Gaussian integers.
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+…
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…
In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…
A pair $(a, b)$ of positive integers is a pythagorean pair if $a^2 + b^2 = \Box$ (i.e., $a^2 + b^2$ is a square). A pythagorean pair $(a, b)$ is called a double-pythapotent pair if there is another pythagorean pair $(k,l)$ such that…
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 investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…
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…
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…
In 2014, T. Komatsu and L. Szalay studied the balancing binomial coefficients. In this paper, we focus on the following Diophantine equation $$\binom{1}{5}+\binom{2}{5}+...+\binom{x-1}{5}=\binom{x+1}{5}+...+\binom{y}{5}$$ where $y>x>5$ are…
The objective of the paper is to determine the complete solutions for the Diophantine equation $x^2 + 3^{\alpha}113^{\beta} = y^{\mathfrak{n}}$ in positive integers $x$ and $y$ (where $x, y \geq 1$), non-negative exponents $\alpha$ and…