Unsolvability of the equation \(x^n-y^2=az^m\) with small greatest common divisor \(\text{gcd}(n,h(-a))\)

DOI10.1007/S000130050184zbMATH Open0913.11013OpenAlexW2015535522MaRDI QIDQ1383686

Klaus Langmann

Publication date: 16 August 1998

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000130050184

zbMATH Keywords

primesarithmetic progressionFermat-Catalan equation

Mathematics Subject Classification ID

Class numbers, class groups, discriminants (11R29) Higher degree equations; Fermat's equation (11D41)

Related Items (1)

Unsolvability of the equation \(\alpha x^n + \beta y^n = z^n\) and uniform distribution of \(\root n \of {\alpha x^n + \beta y^n}\)

This page was built for publication: Unsolvability of the equation \(x^n-y^2=az^m\) with small greatest common divisor \(\text{gcd}(n,h(-a))\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383686)