Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalised Fermat equation: a survey of solved cases

Published 16 Dec 2024 in math.NT | (2412.11933v2)

Abstract: Generalised Fermat equation (GFE) is the equation of the form $axp+byq=czr$, where $a,b,c,p,q,r$ are positive integers. If $1/p+1/q+1/r<1$, GFE is known to have at most finitely many primitive integer solutions $(x,y,z)$. A large body of the literature is devoted to finding such solutions explicitly for various six-tuples $(a,b,c,p,q,r)$, as well as for infinite families of such six-tuples. This paper surveys the families of parameters for which GFE has been solved. Although the proofs are not discussed here, collecting these references in one place will make it easier for the readers to find the relevant proof techniques in the original papers. Also, this survey will help the readers to avoid duplicate work by solving the already solved cases.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.