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.

This publication has 19 references indexed in Scilit: