Related papers: Problems Regarding a Pair of Diophantine Equations

In this paper, we consider the Diophantine equation $(-1)^{\alpha}p^x+(-1)^{\beta}(2^k(2p+1))^y=z^2$ for Sophie Germain prime $p$ with $\alpha, \beta \in\{0,1\}$, $\alpha\beta=0$ and $k\geq 0$. First, for $p=2$, we solve three Diophantine…

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 this paper, we deal with two classes of Diophantine equations, $x^2+y^2+z^2+k_1yz+k_2zx+k_3xy=(3+k_1+k_2+k_3)xyz$ and $x^2+y^4+z^4+ky^2z^2+2xz^2+2xy^2=(7+k)xy^2z^2$, where $k_1,k_2,k_3,k$ are nonnegative integers. The former is known as…

We derive a closed expression for the number of nonnegative solutions of a certain system of linear Diophantine equations. The motivation comes from high energy physics where the nonnegative solutions play a crucial role in the perturbative…

The solvability of Diophantine quartic equations is a contemporary area of interest due to its connection with generalized Fermat's equation. In this work, we are interested in the integer solutions of a similar Diophantine equation p u^2 =…

Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…

We obtain a polynomial-time algorithm that, given input (A, b), where A=(B|N) is an integer mxn matrix, m<n, with nonsingular mxm submatrix B and b is an m-dimensional integer vector, finds a nonnegative integer solution to the system Ax=b…

Let $\{x_{n}\}_{n \geq 0}$ be the balancing-like sequence defined by $x_{n+1} = A x_{n} - x_{n-1}$, for $A>2$, where $x_0 = 0$ and $x_1 = 1$. In this paper, we demonstrate how to find all the solutions of the Diophantine equation,…

The quadruple $(1\,484\,801, 1\,203\,120, 1\,169\,407, 1\,157\,520)$ already known is essentially the only non-trivial solution of the Diophantine equation $x^4 + 2 y^4 = z^4 + 4 w^4$ for $|x|$, $|y|$, $|z|$, and $|w|$ up to one hundred…

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let f(n) denote the greatest finite total number of solutions of a subsystem of E_n in integers x_1,...,x_n. We prove: (1) the function f is…

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…

On propose une m\'ethode de r\'esolution effective de l'\'equation diophantienne $(E_2): ax^2-by^2=1$ o\`u $a$ et $b$ sont des entiers naturels non nuls et premiers entre eux. Cette m\'ethode s'appuie sur le d\'eveloppement en fraction…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on single-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

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 $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we…

When $k\ge 4$ and $0\le d\le (k-2)/4$, we consider the system of Diophantine equations \[ x_1^j+\ldots +x_k^j=y_1^j+\ldots +y_k^j\quad (1\le j\le k,\, j\ne k-d). \] We show that in this cousin of a Vinogradov system, there is a paucity of…

In the following we consider Diophantine equations of the form $x^2+ zxy + y^2 = M$ for given $M,z \in \mathbb{Z}$ and discuss the number of its (primitive) solutions as well as the construction of them. To reach this goal we introduce…

In this paper, we sharpen earlier work of the first author, Luca and Mulholland, showing that the Diophantine equation $$ A^3+B^3 = q^\alpha C^p, \, \, ABC \neq 0, \, \, \gcd (A,B) =1, $$ has, for "most" primes $q$ and suitably large prime…

We develop a variety of new techniques to treat Diophantine equations of the shape $x^2+D =y^n$, based upon bounds for linear forms in $p$-adic and complex logarithms, the modularity of Galois representations attached to Frey-Hellegouarch…