Results 11 to 20 of about 169 (152)
An exponential diophantine equation [PDF]
Bulletin of the Australian Mathematical Society, 2001 Let p be an odd prime with p > 3. In this paper we give all positive integer solutions (x, y, m, n) of the equation x2 + p2m = yn, gcd (x, y) = 1, n > 2 satisfying 2 | n of 2 ∤ n and p ≢ (−1)(p−1)/2(mod 4n.
openaire +1 more source
Two exponential Diophantine equations [PDF]
Glasgow Mathematical Journal, 1997 In [3], two open problems were whether either of the diophantine equationswith n ∈ Z and f a prime number, is solvable if ω > 3 and 3 √ ω, but in this paper we allow f to be any (rational) integer and also 3 | ω. Equations of this form and more general ones can effectively be solved [5] with an advanced method based on analytical results, but the ...
openaire +1 more source
A brief survey on the generalized Lebesgue-Ramanujan-Nagell equation [PDF]
Surveys in Mathematics and its Applications, 2020 The generalized Lebesgue-Ramanujan-Nagell equation is an important type of polynomial-exponential Diophantine equation in number theory. In this survey, the recent results and some unsolved problems of this equation are given.
Maohua Le, Gökhan Soydan
doaj
The Exponential Diophantine Equation 4m2+1x+5m2-1y=(3m)z
Abstract and Applied Analysis, 2014 Let m be a positive integer. In this paper, using some properties of exponential diophantine equations and some results on the existence of primitive divisors of Lucas numbers, we prove that if m>90 and 3|m, then the equation 4m2+1x + 5m2-1y=(3m)z has ...
Juanli Su, Xiaoxue Li
doaj +1 more source
Two exponential diophantine equations [PDF]
Journal de théorie des nombres de Bordeaux, 2017 The equation 3 a + 5 b -
openaire +1 more source
Exponential diophantine equations in rings of positive characteristic [PDF]
Journal of Knot Theory and Its Ramifications, 2020 In this paper, we prove an algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive characteristic. Consider the system of exponential-Diophantine equations [Formula: see text] where [Formula: see text] are constants from matrix ring of characteristic [Formula: see text], [Formula: see ...
Chilikov, A. A., Belov-Kanel, Alexey
openaire +1 more source
On a conjecture on exponential Diophantine equations [PDF]
Acta Arithmetica, 2009 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
Cipu, Mihai, Mignotte, Maurice
openaire +3 more sources
A Survey on the ternary purely exponential diophantine equation ax + by = cz [PDF]
Surveys in Mathematics and its Applications, 2019 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 ax + by = cz.
Maohua Le, Reese Scott, Robert Styer
doaj
An upper bound for solutions of the Lebesgue-Nagell equation x 2 + a 2 = y n $x^{2}+a^{2}=y^{n}$
Journal of Inequalities and Applications, 2016 Let a be a positive integer with a > 1 $a>1$ , and let ( x , y , n ) $(x, y, n)$ be a positive integer solution of the equation x 2 + a 2 = y n $x^{2}+a^{2}=y^{n}$ , gcd ( x , y ) = 1 $\gcd(x, y)=1$ , n > 2 $n>2$ .
Xiaowei Pan
doaj +1 more source
On the Diophantine equation 2x + 11y = z2 [PDF]
Maejo International Journal of Science and Technology, 2013 In this paper it is shown that (3,0,3) is the only non-negative integer solution of the Diophantine equation 2x + 11y = z2.
Somchit Chotchaisthit
doaj