ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A,B,C,D,n∈Z+A,B,C,D,n\in\mathbb{Z}_{+} with n≥3n\geq3, and suppose

A+B=C,ABC=Dn.A+B=C,\qquad ABC=D^n.

Assume that gcd⁡(A,B,C)=pk\gcd(A,B,C)=p^k, where pp is an odd prime and k∈Z+k\in\mathbb{Z}_{+}. Generalized Fermat equation conjecture. If n≥3n\geq3 is prime and p≢1(mod2n)p\not\equiv1\pmod{2n}, then the system has no positive integer solutions. This conjecture extends the proved cases n=3n=3 and n=5n=5 discussed in the paper; the stated condition excludes primes p≡1(mod2n)p\equiv1\pmod{2n}, for which the authors construct solutions in certain cases.

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.