Asymptotic Fermat's Last Theorem for a family of equations of signature
arXiv:2404.14098 · doi:10.1112/mtk.12279
Abstract
In this paper, we study the integer solutions of a family of Fermat-type equations of signature , . We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a constant such that if , there are no solutions of the equation. Our methods use the modular method for Diophantine equations, along with level lowering and Galois theory.
20 pages