Let $p$ be a prime number with $p>3$, $p\equiv 3\pmod{4}$ and let $n$ be a positive integer. In this paper, we prove that the Diophantine equation $(5pn^{2}-1)^{x}+(p(p-5)n^{2}+1)^{y}=(pn)^{z}$ has only the positive integer solution $(x,y,z)=(1,1,2)$ where $pn \equiv \pm1 \pmod 5$. As an another result, we show that the Diophantine equation $(35n^{2}-1)^{x}+(14n^{2}+1)^{y}=(7n)^{z}$ has only the positive integer solution $(x,y,z)=(1,1,2)$ where $n\equiv \pm 3% \pmod{5}$ or $5\mid n$. On the proofs, we use the properties of Jacobi symbol and Baker's method.
We are interested in solving the congruences $f^3+g^3+1\equiv 0\pmod{fg}$ and $f^4-4g^2+4\equiv 0\pmod{fg}$ in polynomials $f, g$ with rational coefficients. Moreover, we present results of computations of all integer points on certain one parametric curves of genus 1 and 3, related to cubic and quartic fields, respectively.
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 is the only solution in integers greater than 1, with the possible exception of finitely many values $(c,r)$. We also prove the uniqueness of such a solution if any of $a$, $b$, $c$ is a prime power. In a different vein, we obtain various inequalities that must be satisfied by the components of a putative second solution.
The title equation, where $p>3$ is a prime number $\not\equiv 7 \pmod 8$, $q$ is an odd prime number and $x,y,n$ are positive integers with $x,y$ relatively prime, is studied. When $p\equiv 3\pmod 8$, we prove (Theorem 2.3) that there are no solutions. For $p\not\equiv 3\pmod 8$ the treatment of the equation turns out to be a difficult task. We focus our attention to $p=5$, by reason of an article by F. Abu Muriefah, published in this journal, vol. 128 (2008), 1670-1675. Our main result concerning this special equation is Theorem 1.1, whose proof is based on results around the Diophantine equa…
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 Diophantine system has an integer parametric solution for $f(X)=X(X+a)$ with nonzero integers $a$, if there are integers $m,n,k$ such that \[\begin{cases} \begin{split} (n^2-m^2) (4mnk(k+a+1) + a(m^2+2mn-n^2)) &\equiv0\pmod{(m^2+n^2)^2},\\ (m^2+2mn-n^2) ((m^2-2mn-n^2)k(k+a+1) - 2amn) &\equiv0 \pmod{(m^2+n^2)^2}, \end{split} \end{cases}\] where $k\equiv0\pmod{4}$ when…
Motivated by the recent result of Farhi we show that for each $n\equiv \pm 1\pmod{6}$ the title Diophantine equation has at least two solutions in integers. As a consequence, we get that each (even) perfect number is a sum of three cubes of integers. Moreover, we present some computational results concerning the considered equation and state some questions and conjectures.
We shall show that, for any given primes $\ell\geq 17$ and $p, q\equiv 1\pmod{\ell}$, the diophantine equation $(x^\ell-1)/(x-1)=p^m q$ has at most four positive integral solutions $(x, m)$ and give its application to odd perfect number problem.
We show the insolvability of the Diophantine equation $ax^d-y^2-z^2+xyz-b=0$ in $\mathbb{Z}$ for fixed $a$ and $b$ such that $a\equiv 1 \pmod {12}$ and $b=2^da-3$, where $d$ is an odd integer and is a multiple of $3$. Further, we investigate the more general family with $b=2^da-3^r$, where $r$ is a positive odd integer. As a consequence, we found an infinite family of hyperelliptic curves with trivial torsion over $\mathbb{Q}$. We conclude by providing some numerical evidence corroborating the main results.
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello investigated the parity of $b_{t}(n)$ when $t\leq 28$. They discovered new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving every prime $p$ with $p\equiv 13, 17, 19, 23 \pmod{24}$. In this paper, we investigate the parity of $b_{21}(n)$ involving the primes $p$ with $p\equiv 1, 5, 7, 11 \pmod{24}$. We prove new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving the odd pr…
Let $k,\ell\geq2$ be fixed integers and $C$ be an effectively computable constant depending only on $k$ and $\ell$. In this paper, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(\ell x)^{k}=y^{n}$ in integers $x,y,n$ with $x,y\geq1, n\geq2, k\neq3$ and $\ell\equiv 1 \pmod 2$ satisfy $\max\{x,y,n\}<C$. The case when $\ell$ is even has already been completed by Soydan (Publ. Math. Debrecen 91 (2017), pp. 369-382).
Let $k,l\geq2$ be fixed integers. In this paper, firstly, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(lx)^{k}=y^{n}$ in integers $x,y,n$ with $x,y\geq1, n\geq2$ satisfy $n<C_{1}$ where $C_{1}=C_{1}(l,k)$ is an effectively computable constant. Secondly, we prove that all solutions of this equation in integers $x,y,n$ with $x,y\geq1, n\geq2, k\neq3$ and $l\equiv0 \pmod 2$ satisfy $\max\{x,y,n\}<C_{2}$ where $C_{2}$ is an effectively computable constant depending only on $k$ and $l$.
Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23 \pmod {24}$, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p\geqslant 5$. In this paper, we introduce new infinite Ramanujan type congruences modulo $2$ for $b_3(2n)$. They complement naturally the results of Keith-Zanello and Yao and involve primes in $\mathcal P=\{p \text{ prime …
Let $μ$ be a Gibbs measure of the doubling map $T$ of the circle. For a $μ$-generic point $x$ and a given sequence $\{r_n\} \subset \R^+$, consider the intervals $(T^nx - r_n \pmod 1, T^nx + r_n \pmod 1)$. In analogy to the classical Dvoretzky covering of the circle we study the covering properties of this sequence of intervals. This study is closely related to the local entropy function of the Gibbs measure and to hitting times for moving targets. A mass transference principle is obtained for Gibbs measures which are multifractal. Such a principle was shown by Beresnevich and Velani \cite{BV}…
Let $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x^2+y^{2n}=z^3$ in nonzero coprime integer unknowns $x,y,z$. Using methods of modular forms and Galois representations for approaching Diophantine equations, we show that for $n \in \{5, 31\}$ there are no solutions to this equation. Combining this with previously known results, this allows a complete description of all solutions to the Diophantine equation above for $n \leq 10^7$. Finally, we show that there are also no solutions for $n\equiv -1 \pmod{6}$.
As it follows from the theory of almost periodic functions the set of integer solutions $q$ to the Kronecker system $|ω_{j} q - θ_{j}| < \varepsilon \pmod 1$, $j=1,\ldots,m$, where $1,ω_{1},\ldots,ω_{m}$ are linearly independent over $\mathbb{Q}$, is relatively dense in $\mathbb{R}$. The latter means that there is $L(\varepsilon)>0$ such that any segment of length $L(\varepsilon)$ contains at least one integer solution to the Kronecker system. We give some lower and upper non-effective (asymptotic) estimates for $L(\varepsilon)$ and, in particular, show that $L(\varepsilon) = \left(\frac{1}{\v…
We formulate an exponential Diophantine equation, which is is some sense one order higher that Fermat's Last Theorem. We also give three examples of solutions to this exponential Diophantine equation and formulate a conjecture.
In this paper, the theory of elliptic curves is used for finding the solutions of the quartic Diophantine equation $X^4+Y^4=2(U^4+V^4)$ Keywords: Diophantine equation, Elliptic curve, Congruent number
In this work, we accomplish three goals. First, we determine the entire family of positive integer solutions to the three- variable Diophantine equation, xy=z^2; for n=2,3,4,5,6. For n=2, we obtain a 3-parameter family of solutions; for n=3, a 5-parameter of solutions; likewise for n=4. For n=5, a 7-parameter family of solutions; and likewise for n=6. See Theorems 2 through 6 respectively. The second goal of this paper, is determining all the positive integer solutions of xyz=w^2. This is done in Theorem7; the solution set is described in terms of six independent parameters. Finally, in Theore…
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in diophantine approximation.
In this paper we suggest an implementation of Runge's method for solving Diophantine equations satisfying Runge's condition. In this implementation we avoid the use of Puiseux series and algebraic coefficients.
The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be the solution of the algebraic equations of the first, second and higher orders in two or more variables, non-algebraic Diophantine equations and systems of Diophantine equations in the domain of the natural numbers. The estimate for the number of positive integer solutions of the second-order Diophantine equations in two, three or more variables is geometri…
We first recall the connection, going back to A. Thue, between rational approximation to algebraic numbers and integer solutions of some Diophantine equations. Next we recall the equivalence between several finiteness results on various Diophantine equations. We also give many equivalent statements of Mahler's generalization of the fundamental theorem of Thue. In particular, we show that the theorem of Thue--Mahler for degree $3$ implies the theorem of Thue--Mahler for arbitrary degree $\ge3$, and we relate it with a theorem of Siegel on the rational integral points of the projective line $¶^1…
In this paper we obtain a parametric solution of the hitherto unsolved diophantine equation $(x_1^5+x_2^5)(x_3^5+x_4^5)=(y_1^5+y_2^5)(y_3^5+y_4^5)$. Further, we show, using elliptic curves, that there exist infinitely many parametric solutions of the aforementioned diophantine equation, and they can be effectively computed.
In this paper we show a way to generalize the linear Diophantine equation a1x1+a2x2+...+anxn=d . We deal with the nonlinear Diophantine equation det|A X|=+-d , which generalizes the linear one, and we give a necessary and sufficient condition for its solvabiliy. We show how the linear equation can be considered as a particular case of the nonlinear equation.
The paper assesses the top number of integer solutions for algebraic Diophantine Thue diagonal equation of the degree $n \geq 2$ and number of variables $k > 2$ and equations with explicit variable in the case when the coefficients of the equation are of the opposite signs. The author found integer conversions that maintain the asymptotic behavior of the number of integer solutions of algebraic Diophantine equation in the case of the conversion equation to diagonal form. The paper considers the estimation of the number of integer solutions for some types of algebraic Diophantine equations with…
The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for which the Diophantine equatio (y + q1 )(y + q2 ) .... (y + qm ) = f(x) has finitely many solutions in integers. Also assuming ABC Conjecture, we study the conditions for finiteness of integer solutions of the Diophantine equation f(x) = g(y).
In this paper, we obtain new results on the integers solutions X, Y, Z of the diophantine equation X^t+Y^t=BZ^t for a rationnal integer B and a prime number t verifying some conditions explained in the paper.
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 equation and solve it completely.
We show that the diophantine equation $n^\ell+(n+1)^\ell + ...+ (n+k)^\ell=(n+k+1)^\ell+ ...+ (n+2k)^\ell$ has no solutions in positive integers $k,n \ge 1$ for all $\ell \ge 3$.
In this paper, we prove a theorem about the integer solutions to the Diophantine equation $x^{4}-q^{4}=py^{r}$, extending previous work of K.Gy\H ory, and F.Luca and A.Togbe, and of the author.
In 1956, Je$\acute{s}$manowicz conjectured that, for positive integers $m$ and $n$ with $m>n, \, \gcd(m,\, n)=1$ and $m\not\equiv n\pmod{2}$, the exponential Diophantine equation $(m^2-n^2)^x+(2mn)^y=(m^2+n^2)^z$ has only the positive integer solution $(x,\,y,\, z)=(2,\,2,\,2)$. Recently, Ma and Chen \cite{MC17} proved the conjecture if $4\not|mn$ and $y\ge2$. In this paper, we present an elementary proof of the result of Ma and Chen \cite{MC17}.
\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine equation. The proof of our main theorem uses lower bounds for linear forms of logarithms, properties of continued fractions, and a version of the Baker-Davenport reduction method in Diophantine approximation.
Let $f(x)=x^{2}(x^{2}-1)(x^{2}-2)(x^{2}-3).$ We prove that the Diophantine equation $ f(x)=2f(y)$ has no solutions in positive integers $x$ and $y$, except $(x, y)=(1, 1)$.
Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions
We propose a conjecture, similar to Skolem's conjecture, on a Hasse-type principle for exponential diophantine equations. We prove that in a sense the principle is valid for "almost all" equations. Based upon this we propose a general method for the solution of exponential diophantine equations. Using a generalization of a result of Erdős, Pomerance and Schmutz concerning Carmichael's $λ$ function, we can make our search systematic for certain moduli needed in the method.
In this paper we obtain several parametric solutions of the quartic diophantine equation $(x_1^4+x_2^4)(y_1^4+y_2^4)=z_1^4+z_2^4$. We also show how infinitely many parametric solutions of this equation may be obtained by using elliptic curves.
In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in Diophantine approximation, due to Dujella and Pethö. This paper extends the previous work of \cite{Patel}.
We propose an equivalent condition for the Markov triples, which was mentioned by H. Rademacher essentially. As an application, we study the solvability of the Diophantine equation $a^2+b^2+c^2=abcf(a,b,c)$.
Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the study of decompositions of lacunary polynomials and the finiteness criterion for the equations of type f(x) = g(y).
This paper investigates the upper bound of the number of integer (natural) solutions of inhomogeneous algebraic Diophantine diagonal equations with integer coefficients without a free member via the circle method of Hardy and Littlewood. Author found the upper bound of the number of natural solutions of inhomogeneous algebraic Diophantine diagonal equations with explicit variable. He developed a method in the paper, which allows you to perform the low estimate of the number of natural (integer) solutions of algebraic Diophantine equation with integer coefficients. Author obtained a lower estim…
In this paper, we prove an asymptotic formula for the average number of solutions to the Diophantine equation $axy-x-y=n$ in which $a$ is fixed and and $n$ varies.
In this article, we consider the equation x^2+19^{m}=y^n, n>2, m>0. We find the solutions of the title equation for not only 2 \mid m but also 2\notdividesm.
In this paper, we find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.
The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.
Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not known, Gerardin and Piezas found solutions of this equation when $h$ is given by polynomials of degrees 5 and 2 respectively. In this paper, we present several new solutions of this equation when $h$ is given by polynomials of degrees $2,\;3$ and 4.
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 solutions. In this paper, we consider the transformation to the diagonal form of a wider class of algebraic second-order Diophantine equations, and also we consider the conditions for converting higher order algebraic Diophantine equations to this form. The author found an asymptotic estimate for the number of integer solutions of the diagonal Thue equation of odd…
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$.
