Abstract
Let be a totally real field. By the asymptotic Fermat's Last Theorem over we mean the statement that there is a constant such that for prime exponents the only solutions to the Fermat equation with , , in are the trivial ones satisfying . With the help of modularity, level lowering and image of inertia comparisons we give an algorithmically testable criterion which if satisfied by implies the asymptotic Fermat's Last Theorem over . Using techniques from analytic number theory, we show that our criterion is satisfied by for a subset of having density among the squarefree positive integers. We can improve this to density 1 if we assume a standard "Eichler-Shimura" conjecture.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.