ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A,B,C∈ZA,B,C\in\mathbb{Z} satisfy

A+B+C=0,gcd⁡(A,B,C)=1.A+B+C=0,\qquad \gcd(A,B,C)=1.

For a nonzero integer product ABCABC, let σJ(ABC)\sigma_J(ABC) denote the JJ-depleted Szpiro ratio, obtained by removing up to JJ distinct prime factors before computing the ratio.

Prime-depleted ABCABC-conjecture. There exist an integer J≥0J\ge0 and a constant C5C_5 such that

σJ(ABC)≤C5.\sigma_J(ABC)\le C_5.

The classical ABCABC-conjecture, in the non-optimal-exponent formulation used by the source, asserts boundedness of σ(ABC)\sigma(ABC) and is stronger because σJ(ABC)≤σ(ABC)\sigma_J(ABC)\le\sigma(ABC). The paper states that the prime-depleted ABCABC conjecture follows from the prime-depleted Szpiro conjecture.

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.