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

The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for algebraic Diophantine equation. The author shows the properties of this transformation and he receives the algorithm for finding the matrix elements of a generalized integer orthogonal transformation for algebraic Diophantine equation of the...

In this paper we provide criteria for the insolvability of the Diophantine equation $x^2+D=y^n$. This result is then used to determine the class number of the quadratic field $\mathbb{Q}(\sqrt{-D})$. We also determine some criteria for the divisibility of the class number of the quadratic field $\mathbb{Q}(\sqrt{-D})$ and this result is then used to discuss the solvability of the Diophantine equation $x^2+D=y^n$.

Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete solutions to all these equations. The difficulties of solved equations range from elementary to research level. In the last section, we present a summary table of all solved equations ordered by their size, which makes them easy to find. As a resu...

This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations.

For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms. In this paper, for an integer $d\geq 2$ which is square free, we show that there is at most one value of the positive integer $x$ participating in the Pell equation $x^{2}-dy^{2} =\pm 1$ which is a $k$--generalized Fibonacci number, with a...

Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation $$cx^2+p^{2m}=4y^n,~~x,y\geq 1, m\geq 0, n\geq 3, \gcd(x,y)=1, \gcd(n,2h(-c))=1,$$ and we describe all its integer solutions. Our main tool here is the prominent result of Bilu, Hanrot and Voutier on existence of primitive divisors in Lehmer sequences.

The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such as reference[1](L.E.Dickson's History of the Theory of Numbers, Vol.II) and [2](W.Sierpinski's Elementary Theory of Numbers) shows that little or no material can be found regarding this diophantine equation.Note that when c=1, (x,y)=(1,1) ...

We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations $x^4+axy+y^3=0$ has been an open question. We also present an elementary method that reduces the task of finding all integer solutions to a general three-monomial equation to the task of finding primitive solutions to equations with three monomials in d...

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 n=3, a 5-parameter of solutions; likewise for n=4. For n=5, a 7-parameter family of solutions; and likewise for n=6. See Theorems 2 through 6 respectively. The second goal of this paper, is determining all the positive integer solutions of xyz...

The subject matter of this work is integral points on conics described by the general equation, ax^2+bxy+cy^2+dx+ey+f=0 (1) where the six coefficients are integers satisfying the conditions, b^2-4ac=k^2, with a and c being nonzero and k a positive integer. It is well known the when b^2-4ac>0, equation (1) describes either a hyperbola on the plane or a pair of two straight lines(the degenerate case). The key integer is the number, I=k^2(d^2-4af)-(2ae-bd)^2. In Section 2, we sh...