Related papers: Newer sums of three cubes
Let $n$ be a cubefree natural number and $p\geq 5$ be a prime number. Assume that $n$ is not expressible as a sum of the form $x^3+y^3$, where $x,y\in \mathbb{Q}$. In this note, we study the solutions (or lack thereof) to the equation…
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…
Let $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x^2+y^{2n}=z^3$ in nonzero coprime integer unknowns $x,y,z$. Using methods of modular forms and Galois representations for approaching…
A nontrivial solution of the equation A!B! = C! is a triple of positive integers (A, B, C) with A $\le$ B $\le$ C -- 2. It is conjectured that the only nontrivial solution is (6, 7, 10), and this conjecture has been checked up to C = 10 6.…
We study the distribution of the values of the form $\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^k$, where $\lambda_1$, $\lambda_2$ and $\lambda_3$ are non-zero real number not all of the same sign, with $\lambda_1 / \lambda_2$…
A nonzero rational number is called a cube sum if it is of form $a^3+b^3$ with $a,b\in \mathbb{Q}^\times$. In this paper, we prove that for any odd integer $k\geq 1$, there exist infinitely many cube-free odd integers $n$ with exactly $k$…
This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…
We collect a number of open questions concerning Diophantine equations, Diophantine Approximation and transcendental numbers. Revised version: corrected typos and added references.
In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…
A brief history and two formulations of the Diophantine problem's requirements are presented. One tier consisting of three two-parameter solutions is studied for its ability to provide examples for the small natural numbers considered.…
Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…
This paper is concerned with the diophantine equation $\sum_{i=1}^na_ix_i^4= \sum_{i=1}^na_iy_i^4$ where $n \geq 3$ and $a_i,\,i=1,\,2,\,\ldots,\,n$, are arbitrary integers. While a method of obtaining numerical solutions of such an…
The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.
By first solving the equation $x^3+y^3+z^3=k$ with fixed $k$ for $z$ and then considering the distance to the nearest integer function of the result, we turn the sum of three cubes problem into an optimisation one. We then apply three…
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$.
In this paper we first show that, under certain conditions, the solution of a single quadratic diophantine equation in four variables $Q(x_1,\,x_2,\,x_3,\,x_4)=0$ can be expressed in terms of bilinear forms in four parameters. We use this…
We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…
In this paper, we proved that there are infinitely many integer solutions of $X^6 - Y^6 = W^n - Z^n,\ n=2,3,4$.
In this paper, by using the elliptic curves theory, we study the fourth power Diophantine equation ${ \sum_{i=1}^n a_ix_{i} ^4= \sum_{j=1}^na_j y_{j}^4 }$, where $a_i$ and $n\geq3$ are fixed arbitrary integers. We solve the equation for…
Let $p>3$ be a prime, $a_1,a_2,a_3\in\Bbb Z$ and let $N_p(x^3+a_1x^2+a_2x+a_3)$ denote the number of solutions to the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$. In this paper, we give an explicit criterion for…