相关论文: Perfect Powers that are Sums of Squares of an Arit…

We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.

We prove that the equation $(x-3r)^3+(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3+(x+3r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime. This article complements the work on the equations…

We study the equation $(x-4r)^3 + (x-3r)^3 + (x-2r)^3+(x-r)^3 + x^3 + (x+r)^3+(x+2r)^3 + (x+3r)^3 + (x+4r)^3 = y^p$, which is a natural continuation of previous works carried out by A. Arg\'{a}ez-Garc\'{i}a and the fourth author (perfect…

We prove that the equation $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime.

Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive…

In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…

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 $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no…

In this paper we study the equation $$ x^k + (x+1)^k = y^n,\quad n\geq 3, $$ when $k\equiv 2\pmod{4}$. We prove that the only solutions are for $x=0, -1$ when $6\leq k\leq 100$ or for a $k$ with odd prime factors congruent to $3\pmod{4}$.…

We determine the rational integers x,y,z such that x^3+y^9=z^2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x^3+y^9=z^2 corresponds to a rational point on one of those curves.…

We classify primitive integer solutions to x^2 + y^3 = z^10. The technique is to combine modular methods at the prime 5, number field enumeration techniques in place of modular methods at the prime 2, Chabauty techniques for elliptic curves…

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…

In this paper we determine the perfect powers that are sums of three fifth powers in an arithmetic progression. More precisely, we completely solve the Diophantine equation $$ (x-d)^5 + x^5 + (x + d)^5 = z^n,~n\geq 2, $$ where $d,x,z \in…

In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

We study the equation $F_n + F_m = y^p$, where $F_n$ and $F_m$ are respectively the $n$-th and $m$-th Fibonacci numbers and $p \ge 2$. We find all solutions under the assumption $n \equiv m \pmod{2}$.

Let $d>r\ge 0$ be integers. For positive integers $a,b,c$, if any term of the arithmetic progression $\{r+dn:\ n=0,1,2,\ldots\}$ can be written as $ax^2+by^2+cz^2$ with $x,y,z\in\mathbb{Z}$, then the form $ax^2+by^2+cz^2$ is called…

The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational…

This note proves two theorems regarding Fermat-type equation $x^r + y^r = dz^p$ where $r \geq 5$ is a prime. Our main result shows that, for infinitely many integers~$d$, the previous equation has no non-trivial primitive solutions such…