Related papers: On the Diophantine problem related to power circui…
We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…
In this paper, we present efficient algorithms for solving the Diophantine equation $f(x, y) = m$ for an arbitrary definite binary quadratic form $f$, given the factorization of $m$. While Cornacchia's algorithm to solve $x^2 + dy^2 = m$ is…
In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…
In this paper we obtain a sharp upper bound for the number of solutions to a certain diophantine inequality involving fractions with power denominator. This problem is motivated by a conjecture of Zhao concerning the spacing of such…
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 consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…
In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation $p^x + p^y = z^2$ for a prime number $p$. In that paper they find some solutions to the equation for $p=2, 3$. In this paper, we look at a general version of this…
We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…
In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…
Except for a limited number of cases, a complete classification of the Diophantine sets of polynomial rings and fields of rational functions seems out of reach at present. We contribute to this problem by proving that several natural sets…
Science and mathematics help people better to understand world, eliminating different fallacies and misconceptions. One of such misconception is related to arithmetic, which is so important both for science and everyday life. People think…
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 =…
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…
We investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…
We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…
Geometry and Diophantine equations have been ever-present in mathematics. Diophantus of Alexandria was born in the 3rd century (as far as we know), but a systematic mathematical study of word equations began only in the 20th century. So,…
In 2014, T. Komatsu and L. Szalay studied the balancing binomial coefficients. In this paper, we focus on the following Diophantine equation $$\binom{1}{5}+\binom{2}{5}+...+\binom{x-1}{5}=\binom{x+1}{5}+...+\binom{y}{5}$$ where $y>x>5$ are…
Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…