ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KK be a field of characteristic zero, let pm=x1m+x2m+x3mp_m=x_1^m+x_2^m+x_3^m, and let a,b,ca,b,c be integers satisfying 0<a<b<c0<a<b<c and gcd⁡(a,b,c)=1\operatorname{gcd}(a,b,c)=1. The 6abc conjecture. The polynomials pa,pb,pcp_a,p_b,p_c form a regular sequence if and only if 66 divides abcabc. This conjecture is unresolved in general; one direction holds more generally, and the claim is known for certain special values, including a=1a=1.

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.