“…As in Case I, if q is a primitive divisor of L 7 (α, ᾱ), then only possibility is q = 13. If b 1 = 0, then L 7 (α, ᾱ) has no primitive divisors, and hence as in Case I by [6, Table 2], we have (2 (1,19), (3,5), (5,7), (13,3), (14,22). These are not possible as m = 0, 1.…”
Section: The Case: N ≥ 3 Is Primementioning
confidence: 91%
“…• (k − 2ε, m, u) = (6, 1, 3), which gives (k, m, u, vd) = (4, 1, 3, 5), (8,1,3,89). The only possibility is (k, m, u, vd) = (4, 1, 3, 5), which yields y = 7.…”
Section: The Case: N ≥ 3 Is Primementioning
confidence: 99%
“…There are many results concerning the integer solutions of this equation. We refer to some recent results [3,5,9,10,13,22,25,29].…”
We find all the positive integer solutions (x, y, a, b, c, m, n) of the Diophantine equation in the title for a, b, c, m ≥ 0 and n ≥ 3 with gcd(x, y) = 1.
“…As in Case I, if q is a primitive divisor of L 7 (α, ᾱ), then only possibility is q = 13. If b 1 = 0, then L 7 (α, ᾱ) has no primitive divisors, and hence as in Case I by [6, Table 2], we have (2 (1,19), (3,5), (5,7), (13,3), (14,22). These are not possible as m = 0, 1.…”
Section: The Case: N ≥ 3 Is Primementioning
confidence: 91%
“…• (k − 2ε, m, u) = (6, 1, 3), which gives (k, m, u, vd) = (4, 1, 3, 5), (8,1,3,89). The only possibility is (k, m, u, vd) = (4, 1, 3, 5), which yields y = 7.…”
Section: The Case: N ≥ 3 Is Primementioning
confidence: 99%
“…There are many results concerning the integer solutions of this equation. We refer to some recent results [3,5,9,10,13,22,25,29].…”
We find all the positive integer solutions (x, y, a, b, c, m, n) of the Diophantine equation in the title for a, b, c, m ≥ 0 and n ≥ 3 with gcd(x, y) = 1.
“…Nowadays, there have been many studies about Diophantine equations. Most of their research is about finding the solutions of a given equation, one of which is the work on the equation by Alan and Zengin [2] where are non-negative integers and are realtively prime. There are many forms of Diophantine equations with various variables defined.…”
In this paper, we determine the primitive solutions of diophantine equations x^2+pqy^2=z^2, for positive integers x, y, z, and primes p,q. This work is based on the development of the previous results, namely using the solutions of the Diophantine equation x^2+y^2=z^2, and looking at characteristics of the solutions of the Diophantine equation x^2+3y^2=z^2 and x^2+9y^2=z^2.
“…Cohn [10] and Bugeaud et al [7] studied (1.1) for λ in the range 1 ≤ λ ≤ 100 and others studied (1.1) when λ is a perfect power (see [2][3][4]17]). Many others studied (1.1) when the set of prime factors of λ is fixed (see [1,8,9,11,12,[14][15][16]18]). For a comprehensive survey of equation (1.1) and its generalisations, see Le and Soydan [13] with over 350 references.…”
We find all integer solutions to the equation
$x^2+5^a\cdot 13^b\cdot 17^c=y^n$
with
$a,\,b,\,c\geq 0$
,
$n\geq 3$
,
$x,\,y>0$
and
$\gcd (x,\,y)=1$
. Our proof uses a deep result about primitive divisors of Lucas sequences in combination with elementary number theory and computer search.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.