ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For n∈Nn\in\mathbb{N}, let γ(n)=∏p∣np\gamma(n)=\prod_{p\mid n}p and let ω(n)\omega(n) denote the number of distinct prime factors of nn. Define

H(n):=γ(n)(log⁡γ(n))ω(n).H(n):=\frac{\gamma(n)}{(\log\gamma(n))^{\omega(n)}}.

The convention 00=10^0=1 is used when n=1n=1. The H-refined abc conjecture. For every ϵ>0\epsilon>0, there exists a constant C(ϵ)C(\epsilon) such that for all (a,b,c)∈N3(a,b,c)\in\mathbb{N}^3 with gcd⁡(a,b,c)=1\gcd(a,b,c)=1 and a+b=ca+b=c,

c<C(ϵ)H(abc)1+ϵ.c<C(\epsilon)H(abc)^{1+\epsilon}.

The paper proposes this as a stronger abc-type conjecture because HH is intended to retain more arithmetic information than the radical. The source states applications and heuristics for it, but gives no resolution.

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.