Related papers: L'\'equation diophantienne $ax^2-by^2=1$

In this paper, we present efficient algorithms for solving the Diophantine equation $f(x, y) = m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m$. While Cornacchia's algorithm to solve $x^2 + dy^2 = m$ is…

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

In this paper, we use the method of Thue and Siegel, based on explicit Pade approximations to algebraic functions, to completely solve a family of quartic Thue equations. From this result, we can also solve the diophantine equation in the…

Here, we find all positive integer solutions of the Diophantine equation in the title, where $(\mathcal{U}_n)_{n\geqslant 0}$ is the generalized Lucas sequence $\mathcal{U}_0=0, \ \mathcal{U}_1=1$ and $\mathcal{U}_{n+1}=r \mathcal{U}_n +s…

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…

We consider the simultaneous Pell equations $$x^2 - ay^2 = 1, \qquad z^2 - bx^2 = 1,$$ where $a > b\geq 2$ are positive integers. We describe a procedure which, for any fixed $b$, either confirms that the simultaneous Pell equations have at…

By considering the norm of elements in the ring of integers in $\mathbb{Q}(\sqrt{-a})$, we give an algebraic approach to count the number of integral solutions of diophantine equations of the form $x^2+ay^2=n$ where $a$ is a Heegner number…

In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in…

We shall show that, for any given primes $\ell\geq 17$ and $p, q\equiv 1\pmod{\ell}$, the diophantine equation $(x^\ell-1)/(x-1)=p^m q$ has at most four positive integral solutions $(x, m)$ and give its application to odd perfect number…

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…

Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions

The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For $n=2$ such a procedure is well known, when new variables are components of spinors and they are widely used…

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

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…

Two theorems are demonstrated giving analytical expressions of the fundamental solutions of the Pell equation $X^{2}-DY^{2}=1$ found by the method of continued fractions for two squarefree polynomial expressions of radicands of…

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine…

In this paper, we find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.

In this article, I study and solve the exponential Diophantine equation $M_p^{x} + (M_q + 1)^{y}= (lz)^2$ where $M_p$ and $M_q$ are Mersenne primes, $l$ is a prime number, and $x,y$, and $z$ are non-negative integers. Several illustrations…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

In [1] it is shown that the Diophantine equation $(k!)^n+k^n=(n!)^k+n^k$ only has the trivial solution $n=k$, and $(k!)^n-k^n=(n!)^k-n^k$ only has the solutions $n=k$, $(n, k)=(1, 2),$ and $(2, 1)$. In this article we find all solutions of…