相关论文: The diophantine equation $(2^{k}-1)(b^{k}-1)=y^{q}…
In this paper, we study the diophantine equation ${{\sigma }_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are…
Let $a$, $b$, $c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this survey, we consider some unsolved problems and related works concerning the positive integer solutions $(x,y,z)$ of the ternary purely exponential…
The sufficient conditions for insolvability of the Diophantine equation $\sum_{i=1}^{m}x_i^{n}=bc^{n}$ ($n, m \geq 2$, $b, c\in \mathbb{N}$) in nonnegative integers are obtained for the case where the canonical decomposition of the number…
In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…
Let $B_k$ denote the $k^{th}$ term of balancing sequence. In this paper we find all positive integer solutions of the Diophantine equation $B_n+B_m = x^q$ in variables $(m, n,x,q)$ under the assumption $n\equiv m \pmod 2$. Furthermore, we…
Let $n$ be a positive integer. We study the diophantine equation $ab(ab-1)-na=\Delta^2$, where $a,b$ are positive integers. We also show that if a system of two congruences is soluble, then an equation which is a translation of…
Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots+kF_{k}^p=F_{n}^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers.…
Let $k>2$ be a prime such that $2^k-1$ is a Mersenne prime. Let $n = 2^{\alpha-1}p$, where $\alpha>1$ and $p<3\cdot 2^{\alpha-1}-1$ is an odd prime. Continuing the work of Cai et al. and Jiang, we prove that $n\ |\ \sigma_k(n)$ if and only…
Using only elementary arguments, Cassels solved the Diophantine equation $(x-1)^3+x^3+(x+1)^3=z^2$ in integers $x$, $z$. The generalization $(x-1)^k+x^k+(x+1)^k=z^n$ (with $x$, $z$, $n$ integers and $n \ge 2$) was considered by Zhongfeng…
Let k>=2 and let (Q_{n}^{(k)})_{n>=2-k} be the k-generalized Pell sequence defined by Q_{n}^{(k)}=2Q_{n-1}^{(k)}+Q_{n-2}^{(k)}+...+Q_{n-k}^{(k)} for n>=2 with initial conditions Q_{-(k-2)}^{(k)}=Q_{-(k-3)}^{(k)}=...=Q_{-1}^{(k)}=0,…
Catalan's conjecture claims that the Diophantine equation $x^p-y^q=1$ admits the unique solution $3^2-2^3=1$ in integers $x,y,p,q \ge 2$. The conjecture has been finally proved by P. Mih\u{a}ilescu (2002) using the theory of cyclotomic…
We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…
It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$
In this paper, we study properties of the Diophantine exponents $w_n$ and $w_n^{*}$ for Laurent series over a finite field. We prove that for an integer $n\geq 1$ and a rational number $w>2n-1$, there exist a strictly increasing sequence of…
In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…
Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…
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 a 2011 paper published in the journal "Asian Journal of Algebra"(see reference[1]), the authors consider, among other equations,the diophantine equations 2xy=n(x+y) and 3xy=n(x+y). For the first equation, with n being an odd positive…
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…
According to Skolem's conjecture, if an exponential Diophantine equation is not solvable, then it is not solvable modulo an appropriately chosen modulus. Besides several concrete equations, the conjecture has only been proved for rather…