ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.