Related papers: Solving Quadratic and Cubic Diophantine Equations …

In this note we investigate the set $S(n)$ of positive integer solutions of the title Diophantine equation. In particular, for a given $n$ we prove boundedness of the number of solutions, give precise upper bound on the common value of…

The author showed that any homogeneous algebraic Diophantine equation of the second order can be converted to a diagonal form using an integer non-orthogonal transformation maintaining asymptotic behavior of the number of its integer…

We study algebraic and transcendental powers of positive real numbers, including solutions of each of the equations $x^x=y$, $x^y=y^x$, $x^x=y^y$, $x^y=y$, and $x^{x^y}=y$. Applications to values of the iterated exponential functions are…

Let $g\ge 2$ be an integer and $\mathcal R_g\subset \mathbb N$ be the set of repdigits in base $g$. Let $\mathcal D_g$ be the set of Diophantine triples with values in $\mathcal R_g$; that is, $\mathcal D_g$ is the set of all triples…

In 2016 Izadi and Nabardi (b) showed (4-2-4) has infinitely many integer solutions. They used a specific congruent number elliptic curve.In 2019 Janfada and Nabardi,item C, showed that a necessary condition for n to have an integral…

Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer…

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

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 construct integer solutions {a,b} to the coupled system of diophantine quadratic-cubic equations a^2+b^2=x^3 and a^3+b^3=y^2 for fixed ratios a/b.

Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of…

In this paper we investigate Diophantine equations of the form $T^2=G(\overline{X}),\; \overline{X}=(X_{1},\ldots,X_{m})$, where $m=3$ or $m=4$ and $G$ is specific homogenous quintic form. First, we prove that if…

We show that the query containment problem for monadic datalog on finite unranked labeled trees can be solved in 2-fold exponential time when (a) considering unordered trees using the axes child and descendant, and when (b) considering…

We present a concrete oracle construction for bilinear Diophantine equations of the form $f(x,y) = Axy + Bx + Cy + D$, together with its application as a scalable, hardware-agnostic benchmark for digital quantum computers. The oracle can be…

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…

In this article we establish two new results on quantitative Diophantine approximation for one-parameter families of diagonal ternary indefinite forms. In the first result, we consider quadratic forms taking values at prime points. In the…

Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.

Let $n$ be a positive integer. We discuss pairs of distinct odd primes $p$ and $q$ not dividing $n$ for which the Diophantine equations $pq=x^2+ny^2$ have integer solutions in $x$ and $y$. As its examples we classify all such pairs of $p$…

We solve completely the Lebesgue-Nagell equation x^2+D=y^n, in integers x, y, n>2, for D in the range 1 =< D =< 100.

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…

We show how to adapt the Hardy--Littlewood circle method to count monochromatic solutions to diagonal Diophantine equations. This delivers a lower bound which is optimal up to absolute constants. The method is illustrated on equations…