The generalized Fermat conjecture with coefficients supported on a finite prime set

Let SS be a finite set of primes. Consider integer solutions (a,b,c,x,y,z,p,q,r)(a,b,c,x,y,z,p,q,r) of the generalized Fermat equation eqrefeq:genfermateqref{eq:genfermat} satisfying gcd(ax,by,cz)=1\gcd(ax,by,cz)=1, p,q,r>0p,q,r>0, and 1/p+1/q+1/r<11/p+1/q+1/r<1, with every prime factor of abcabc belonging to SS. Finite-support generalized Fermat conjecture. For every finite set SS of primes, there are only finitely many such solutions. This is presented as another conjectural finiteness statement implied by the abc philosophy, allowing the coefficients to vary while restricting their prime support. Its status is not specified in the supplied text.

Sources & referencesView supporting material

Primary source

Ashleigh Ratcliffe and Bogdan Grechuk, “Generalised Fermat equation: a survey of solved cases”, arXiv:2412.11933 (2025).

Additional references

2 papers in this index state this conjecture (2022–2024). The statement above is taken from the most recent of them; the others are arXiv:2212.10627.

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.