Asymptotic Fermat's last theorem for a family of equations of signature \((2, 2n, N)\) (Q7014435)

In this paper, the author studies the integer solutions of a family of Fermat-type equations \(Cx^2 + q^k y^{2n} = z^n\) (where \(C\), \(q\) and \(k\) are fixed positive integers, with \(C\) squarefree and \(q \geq 3\) a prime). He provides an algorithmically testable set of conditions which, if satisfied, imply the existence of a constant \(B_{C,q}\) such that if \( n > B_{C,q}\), there are no solutions \((x,y,z,n)\) of the equation (Theorem 3).\N\NTo prove Theorem 3, he uses the modular method for Diophantine equations, along with level lowering and Galois theory. The determination of whether any of the hypotheses in Theorem 3 are satisfied can be done in a computationally effective manner: he provides the reader with explanations of the computations in Section 7 (for \(1 \leq C \leq 70\) and \(3 \leq q < 100\)) and with Magma code in the GitHub repository.