Related papers: On the equation $x^2-Dy^2=n$

We investigate the solvability of the Diophantine equation $x^2-my^2=\pm p$ in integers for certain integer $m$ and prime $p$. Then we apply these results to produce family of maximal real subfield of a cyclotomic field whose class number…

In this short note we study the existence and number of solutions in the set of integers ($Z$) and in the set of natural numbers ($N$) of Diopahntine Equations of second degree with two variables of the general form $ax^2-by^2=c$.

The Diophantine equation (x^n-1)/(x-1)=y^q has four known solutions in integers x, y, q and n with |x|, |y|, q > 1 and n > 2. Whilst we expect that there are, in fact, no more solutions, such a result is well beyond current technology. In…

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

On propose une m\'ethode de r\'esolution effective de l'\'equation diophantienne $(E_2): ax^2-by^2=1$ o\`u $a$ et $b$ sont des entiers naturels non nuls et premiers entre eux. Cette m\'ethode s'appuie sur le d\'eveloppement en fraction…

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.

The solvability of Diophantine quartic equations is a contemporary area of interest due to its connection with generalized Fermat's equation. In this work, we are interested in the integer solutions of a similar Diophantine equation p u^2 =…

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

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…

Let $[x]$ denote the integral part of the real number $x$, and $N$ be a sufficiently large integer. In this paper, it is proved that, for $1<c<\frac{4109054}{1999527}, c\not=2$, the Diophantine equation…

We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…

It is a generalization of Pell's equation $x^2-Dy^2=0$. Here, we show that: if our Diophantine equation has a particular integer solution and $ab$ is not a perfect square, then the equation has an infinite number of solutions; in this case…

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

Let $1<c<\frac{26088036}{12301745},c\not=2$ and $N$ be a sufficiently large real number. In this paper, it is proved that, for almost all $R\in (N,2N]$, the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c-R\big|<\log^{-1}N…

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…

First, we consider the equation $ax^2 - by^2 + c = 0$, with $a,b \in N*$ and $c \in Z*$, which is a generalization of Pell's equation. Here, we show that: if this equation has an integer solution and $ab$ is not a perfect square, then it…

Given odd, coprime integers $a$, $b$ ($a>0$), we consider the Diophantine equation $ax^2+b^{2l}=4y^n$, $x, y\in\Bbb Z$, $l \in \Bbb N$, $n$ odd prime, $\gcd(x,y)=1$. We completely solve the above Diophantine equation for…

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

In this paper we show that, for any fixed $1<c<\frac{5363}{3900}$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c+p_5^c-N|<\varepsilon…