Related papers: On the sum of fourth powers in arithmetic progress…

We prove that every Diophantine quadruple in $\mathbb{R}[X]$ is regular. More precisely, we prove that if $\{a, b, c, d\}$ is a set of four non-zero polynomials from $\mathbb{R}[X]$, not all constant, such that the product of any two of its…

We obtain best possible results for the number of coprime positive integer solutions of the equation in the title when $a$ is a positive integer, $b=p^{m}$, $2p^{m}$ or $4p^{m}$, where $m$ is a non-negative integer, $p$ is prime, $\gcd…

In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform…

In this article we show that the form $x^2 + iy^2 + z^2 + iw^2$ represents all gaussian integers. The main tools used in this proof are Fermat's little theorem (over finite field extensions), the Mordell-Niven theorem (representation of…

Let $d\equiv 2\pmod 4$ be a square-free integer such that $x^2 - dy^2 =- 1$ and $x^2 - dy^2 = 6$ are solvable in integers. We prove the existence of infinitely many quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ when $n \in…

In this paper, the theory of elliptic curves is used for finding the solutions of the quartic Diophantine equation $X^4+Y^4=2(U^4+V^4)$ Keywords: Diophantine equation, Elliptic curve, Congruent number

Euler showed that there can be no more than three integer squares in arithmetic progression. In quadratic number fields, Xarles has shown that there can be arithmetic progressions of five squares, but not of six. Here, we prove that there…

Lagrange's four-square theorem asserts that any $n\in\mathbb N=\{0,1,2,\ldots\}$ can be written as the sum of four squares. This can be further refined in various ways. We show that any $n\in\mathbb N$ can be written as $x^2+y^2+z^2+w^2$…

A linear quaternionic equation in one quaternionic variable q is of the form $a_1 q b_1+a_2 q b_2+ ... +a_m q b_m = c$, where the $a_i, b_j, c$ are given quaternionic coefficients. If introducing basis elements $\bf i, j, k$ of pure…

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

Since 1772, when Euler first described two methods of obtaining two pairs of biquadrates with equal sums, several methods of solving the diophantine equation $x^4+y^4=z^4+w^4$ have been published. All these methods yield parametric…

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

In this paper we prove that equations of the form $x^{13} + y^{13} = Cz^{p}$ have no non-trivial primitive solutions (a,b,c) such that $13 \nmid c$ if $p > 4992539$ for an infinite family of values for $C$. Our method consists in relating a…

Let $F \in \mathbb Z[x, y]$ be an irreducible binary form of degree $d \geq 7$ and content one. Let $\alpha$ be a root of $F(x, 1)$ and assume that the field extension $\mathbb Q(\alpha)/\mathbb Q$ is Galois. We prove that, for every…

In this paper, we consider the equation \[ x^2 - q^{2k+1} = y^n, \qquad q \nmid x, \quad 2 \mid y, \] for integers $x,q,k,y$ and $n$, with $k \geq 0$ and $n \geq 3$. We extend work of the first and third-named authors by finding all…

We show that there are $O(B^{3/5-3/1555+\ep})$ triples $(x,y,z)$ of square-full integesr up to $B$ satisfying the equation $x+y=z$ for any fixed $\ep>0$. This is the first improvement over the `easy' exponent $3/5$, given by Browning and…

With a simple transformation of the three exponents the generalized Fermat equation can be put into the same form as the Fermat equation. When it is rewritten into this new altered form any real solutions to the altered equation equal a…

We establish an asymptotic formula for the number of integer solutions to the Markoff-Hurwitz equation \[ x_{1}^{2}+x_{2}^{2}+\ldots+x_{n}^{2}=ax_{1}x_{2}\ldots x_{n}+k. \] When $n\geq4$ the previous best result is by Baragar (1998) that…

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 show that for integers $k\geq 4$ and $s\geq k^2+(3k-1)/4$, we have an asymptotic formula for the number of solutions, in positive integers $x_i$, to the inequality $\left|(x_1-\theta_1)^k+\dotsc+(x_s-\theta_s)^k-\tau\right|<\eta$, where…