The generalized Fermat finiteness conjecture over the integers

At least 13 years old · documented by

Let A,B,C∈ZA,B,C\in\mathbb{Z} satisfy gcd⁡(A,B,C)=1\gcd(A,B,C)=1. For prime exponents p,q,rp,q,r with

1p+1q+1r<1,\frac{1}{p}+\frac{1}{q}+\frac{1}{r}<1,

a non-trivial primitive integer solution of Axp+Byq+Czr=0Ax^p+By^q+Cz^r=0 is a solution with xyz≠0xyz\ne0 and gcd⁡(x,y,z)=1\gcd(x,y,z)=1. Generalized Fermat finiteness conjecture. Over all choices of such prime exponents p,q,rp,q,r, the generalized Fermat equation Axp+Byq+Czr=0Ax^p+By^q+Cz^r=0 has only finitely many non-trivial primitive integer solutions. This is a finiteness conjecture for generalized Fermat equations; the supplied text gives no resolution status.

References

Primary source

Satyabrat Sahoo, “A survey on the generalized Fermat equation of various signatures over totally real fields”, arXiv:2512.04936 (2025).

Additional references

4 papers in this index state this conjecture (2012–2025). The statement above is taken from the most recent of them; the others are arXiv:2509.21083, arXiv:2404.09171, arXiv:1203.3371.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.