Not checkedNot checked for notices yet.
An upper bound for solutions of the Lebesgue-Nagell equation x 2 + a 2 = y n $x^{2}+a^{2}=y^{n}$
Xiaowei Pan
Journal of Inequalities and Applications · 2016
doi:10.1186/s13660-016-1154-5 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Abstract 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$. Using Baker’s method, we prove that, for any positive number ϵ, if n is an odd integer with n > C ( ϵ ) $n>C(\epsilon)$, where C ( ϵ ) $C(\epsilon)$ is an effectively computable constant depending only on ϵ, then n < ( 2 + ϵ ) ( log a ) / log y $n<(2+\epsilon)(\log a)/\log y$. Owing to the obvious fact that every solution ( x, y, n ) $(x, y, n)$ of the equation satisfies n > 2 ( log a ) / log y $n>2(\log a)/\log y$, the above upper bound is optimal.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.