ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be an integer. An ABC-solution is a triple s=(a,b,c)\mathbf{s}=(a,b,c) of distinct relatively prime integers satisfying a+b+c=0a+b+c=0, with aa and bb negative. For n>0n>0, define rad⁡(n)\operatorname{rad}(n) as the product of all primes dividing nn, and set

f(s,ϵ)=log⁡(c)−(1+ϵ)log⁡rad⁡(abc).f(\mathbf{s},\epsilon)=\log(c)-(1+\epsilon)\log \operatorname{rad}(abc).

Congruence ABC conjecture for NN. For each ϵ>0\epsilon>0, there exists a constant CϵC_\epsilon such that

f(s,ϵ)<Cϵf(\mathbf{s},\epsilon)<C_\epsilon

for all ABC-solutions s\mathbf{s} such that N∣abcN\mid abc. These are weaker, congruence-restricted versions of the ABC conjecture. The source explains that Oesterlé had shown the case N=16N=16 implies the full ABC conjecture and proposes the family for every integer NN; no resolution status is supplied here.

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.