A Method to Solve the Diophantine Equation $ax^2-by^2+c=0$

In this study, we find continued fraction expansion of sqrt(d) when d=a^2b^2-b and d=a^2b^2-2b where a and b are positive integers. We consider the integer solutions of the Pell equations x^2-(a^2b^2-b)y^2=N and x^2-(a^2b^2-2b)y^2=N when N is {+-1,+-4}. We formulate the n-th solution (x_{n},y_{n}) by using the continued fraction expansion. We also formulate the n-th solution (x_{n},y_{n}) in terms of generalized Fibonacci and Lucas sequences.

In this paper we consider the Diophantine equation $x^2+q^{2m}=2y^p$ where $m,p,q,x,y$ are integer unknowns with $m>0,$ $p$ and $q$ are odd primes and $\gcd(x,y)=1.$ We prove that there are only finitely many solutions $(m,p,q,x,y)$ for which $y$ is not a sum of two consecutive squares. We also study the above equation with fixed $y$ and with fixed $q.$

In this paper, we deal with the quartic diophantine equation $X^4-Y^4=R^2-S^2$ to present its infinitely many integer solutions.

In this paper, we solve the simultaneous Diophantine equations m.(x_1^k+....+x_{t_1}^k)=n.(y_1^k+....+y_{t_2}^k); k=1,3, where t_1, t_2>3, and m, n are fixed arbitrary and relatively prime positive integers. This is done by choosing two appropriate trivial parametric solutions and obtaining infinitely many nontrivial parametric solutions. Also we work out some examples, in particular the Diophantine systems of A^k+B^k+C^k=D^k+E^4; k=1,3.

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$...

A new formulation of the subject equation is presented. Several parametric and semi-parametric solutions are derived. The parametric solution for a=-1 was originally presented in 1972, but never published. A computer-generated version was found by Zajta and published in 1983. The pencil-and-paper version is presented for the record, along with many other examples, including eight coincidental triplet solutions.

Let $\ k$ be a natural number and $d=k^{2}\pm 4$ or $k^{2}\pm 1$. In this paper, by using continued fraction expansion of $\sqrt{d},$ we find fundamental solution of the equations $x^{2}-dy^{2}=\pm 1$ and we get all positive integer solutions of the equations $x^{2}-dy^{2}=\pm 1$ in terms of generalized Fibonacci and Lucas sequences. Moreover, we find all positive integer solutions of the equations $x^{2}-dy^{2}=\pm 4$ in terms of generalized Fibonacci and Lucas sequences. Al...

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 solutions of this equation, and then use the main finding to deduce some results concerning the integers solutions of some of its variants. The methods adopted here are elementary in nature and are primarily based on the existence of the primitiv...

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p congruent to 7 modulo 8. In addition to the above, assume that one of the following holds: Either (i) n^2-p>0 and the positive integer is a prime, Or (ii) n^2-p<0 and the positive integer N=-m=-(n^2-p) is a prime. Then the diophantine equa...

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 som...