Related papers: Diophantine equations with sum of cubes and cube o…

This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p…

Let f in Z[X,Y,Z] be a non-constant, absolutely irreducible, homogeneous polynomial with integer coefficients, such that the projective curve given by f=0 has a function field isomorphic to the rational function field Q(t). We show that all…

We solve a family of quadratic Diophantine equations associated to a simple kind of games. We show that the ternary case, in many ways, is the most interesting and the least arbitrary member of the family.

We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.

Let $\bar{X}_{n}=(x_{1},\ldots,x_{n})$ and $\sigma_{i}(\bar{X}_{n})=\sum x_{k_{1}}\ldots x_{k_{i}}$ be $i$-th elementary symmetric polynomial. In this note we prove that there are infinitely many triples of integers $a, b, c$ such that for…

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

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…

For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…

Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…

Let $\mathbb{F}_q$ be a finite field of $q=p^k$ elements. For any $z\in \mathbb{F}_q$, let $A_n(z)$ and $B_n(z)$ denote the number of solutions of the equations $x_1^3+x_2^3+\cdots+x_n^3=z$ and $x_1^3+x_2^3+\cdots+x_n^3+zx_{n+1}^3=0$…

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 $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…

The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…

The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such…

We prove that there exist infinitely many quartic rational Diophantine quadruples, that is, sets of four pairwise distinct nonzero rational numbers whose pairwise products increased by 1 are fourth powers in Q. To the best of our knowledge,…

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…

We consider the Diophantine equation $7x^{2} + y^{2n} = 4z^{3}$. We determine all solutions to this equation for $n = 2, 3, 4$ and $5$. We formulate a Kraus type criterion for showing that the Diophantine equation $7x^{2} + y^{2p} = 4z^{3}$…

Let $r\ge 1$ be an integer and ${\bf U}:=\{U_n\}_{n\ge 0}$ be the Lucas sequence given by $U_0=0,~U_1=1$, and $U_{n+2}=rU_{n+1}+U_n$ for $n\ge 0$. In this paper, we explain how to find all the solutions of the Diophantine equation,…

We refine a result of W.P. Li and Wang on the values of the form $ \lambda_1p_1 + \lambda_2p_2^{2} + \lambda_3p_3^{2} + \mu_1 2^{m_1} +...+ \mu_s 2^{m_s}, $ where $p_1,p_2,p_3$ are prime numbers, $m_1,..., m_s$ are positive integers,…

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