Let $\ell, m, r$ be fixed positive integers such that $2\nmid \ell$, $3\nmid \ell m$, $\ell>r$ and $3\mid r$. In this paper, using the BHV theorem on the existence of primitive divisors of Lehmer numbers, we prove that if $\min\{r\ell m^2-1,(\ell-r)\ell m^2+1\}>30$, then the equation $(r\ell m^2-1)^x+((\ell -r)\ell m^2+1)^y=(\ell m)^z$ has only the positive integer solution $(x,y,z)=(1,1,2)$.
Let $a$, $b$, $c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this survey, we consider some unsolved problems and related works concerning the positive integer solutions $(x,y,z)$ of the ternary purely exponential diophantine equation $a^x + b^y = c^z$.
Let $a,b,c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this paper, by analyzing the gap rule for solutions of the ternary purely exponential diophantine equation $a^x+b^y=c^z$, we prove that if $\max\{a,b,c\}\geq 10^{62}$, then the equation has at most two positive integer solutions $(x,y,z)$.
Let k\geq 2 and consider the Diophantine inequality |x_1^k-\alp_2 x_2^k-\alp_3 x_3^k| <\tet. Our goal is to find non-trivial solutions in the variables x_i, 1\leq i\leq 3, all of size about P, assuming that \tet is sufficiently large. We study this problem on average over \alp_3 and generalize previous work of Bourgain on quadratic ternary diagonal forms to general degree k.
Let $c$ be fixed with $1<c<35/34$. In this paper we prove that for every sufficiently large real number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c-N|<\varepsilon \end{equation*} is solvable in primes $p_1,\,p_2,\,p_3$ near to squares.
Let $a,b,c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this paper, combining the Gel'fond-Baker method with an elementary approach, we prove that if $\max\{a,b,c\}>5\times 10^{27}$, then the equation $a^x+b^y=c^z$ has at most three positive integer solutions $(x,y,z)$.
In this paper, we prove results about solutions of the Diophantine equation $x^p+y^p=z^3$ over various number fields using the modular method. Firstly, by assuming some standard modularity conjecture we prove an asymptotic result for general number fields of narrow class number one satisfying some technical conditions. Secondly, we show that there is an explicit bound such that the equation $x^p+y^p=z^3$ does not have a particular type of solution over $K=\Q(\sqrt{-d})$ where $d=1,7,19,43,67$ whenever $p$ is bigger than this bound. During the course of the proof we prove various results about …
Let $1 < k < 33 / 29$. We prove that if $λ_1$, $λ_2$ and $λ_3$ are non-zero real numbers, not all of the same sign and that $λ_1 / λ_2$ is irrational and $\varpi$ is any real number, then for any $\eps > 0$ the inequality $ \bigl|λ_1 p_1 + λ_2 p_2^2 + λ_3 p_3^k + \varpi \bigr| \le \bigl(\max_j p_j \bigr)^{-(33 - 29 k) / (72 k) + \eps} $ has infinitely many solutions in prime variables $p_1$, ..., $p_k$.
In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation $3^{a}+3^{b}+2=n^5$, where $(n,3)=1$ and $a>b>0$ is insoluble for pairs of positive integers $(a,b)$ where they are both even or one is even and the other is odd. In the case where both $(a,b)$ are odd, there is one known solution $2^5=3^3+3^1+2.$ We will show that there are no other solutions to the diophantine equation for $n^{5}<32\left(1+3(10^6)\right)^5$.
We solve a family of quadratic Diophantine equations associated to a simple kind of games. We show that the ternary case, in many ways, is the most interesting and the least arbitrary member of the family.
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
Let $u_k$ be a Lucas sequence. A standard technique for determining the perfect powers in the sequence $u_k$ combines bounds coming from linear forms in logarithms with local information obtained via Frey curves and modularity. The key to this approach is the fact that the equation $u_k=x^n$ can be translated into a ternary equation of the form $a y^2=b x^{2n}+c$ (with $a$, $b$, $c \in \mathbb{Z}$) for which Frey curves are available. In this paper we consider shifted powers in Lucas sequences, and consequently equations of the form $u_k=x^n+c$ which do not typically correspond to ternary equa…
A formalism of arithmetic partial differential equations (PDEs) is being developed in which one considers several arithmetic differentiations at one fixed prime. In this theory solutions can be defined in algebraically closed p-adic fields. As an application we show that for at least two arithmetic directions every elliptic curve possesses a non-zero arithmetic PDE Manin map of order 1; such maps do not exist in the arithmetic ODE case. Similarly we construct and study "genuinely PDE" differential modular forms. As further applications we derive a Theorem of the Kernel and a Reciprocity Theore…
