Related papers: A quartic diophantine equation inspired by Brahmag…
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…
This article proves that there are infinitely many primes of the form a^2 + b^4, in fact getting the asymptotic formula. The main result is that \sum_{a^2 + b^4\le x} \Lambda(a^2 + b^4) = 4\pi^{-1}\kappa x^{3/4} (1 + O(\log\log x / \log x))…
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…
Recently found all the fundamental solutions of a multidimensional singular elliptic equation are expressed in terms of the well-known Lauricella hypergeometric function in many variables. In this paper, we find a unique solution of the…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…
In this paper, we consider elliptic curves induced by rational Diophantine quadruples, i.e. sets of four nonzero rationals such that the product of any two of them plus 1 is a perfect square. We show that for each of the groups…
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.
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…
Some upper bounds for the number of monogenizations of quartic orders are established by considering certain classical Diophantine equations, namely index form equations in quartic number fields, and cubic and quartic Thue equations.
We consider the Diophantine equation $x^4 + y^4 - w^2 = n$ for $n \in \mathbb{Z}$, which is related to near misses for the quartic case of Fermat's Last Theorem. For certain $n$ we show that the set of solutions is infinite, or more…
We develop an algebraic method of studying of Diophantine quadratic equations in three variables over the ring of Gaussian integers.
For a finitely generated group $G$, the \emph{Diophantine problem} over $G$ is the algorithmic problem of deciding whether a given equation $W(z_1,z_2,\ldots,z_k) = 1$ (perhaps restricted to a fixed subclass of equations) has a solution in…
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 give a method to solve generalized Fermat equations of type $x^4 + y^4 = q z^p$, for some prime values of $q$ and every prime $p$ bigger than 13. We illustrate the method by proving that there are no solutions for $q= 73, 89$ and 113.
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where…
In this paper we obtain a new parametric solution of the problem of finding two triads of biquadrates with equal sums and equal products.
We give an algebraic identity for cubic polynomials which generalizes Brahmagupta's identity and facilitates arithmetic in cubic fields. We also pose a question about a relationship between the elements of a cubic field of fixed trace and…
By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm g(y)^2$ for some simple Laurent polynomials $f$ and $g$.
Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.