The congruence ABC conjecture for NN

From papers

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+ϵ)lograd(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 NabcN\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.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Jordan S. Ellenberg, “Congruence ABC implies ABC”, arXiv:math/9909098 (1999).

Solutions 0

No solutions have been posted yet.