ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tnt_n denote the quantity associated with the hyperelliptic equation in the paper, and let c∈(0,1)c\in(0,1) be fixed. Assume that nn is a non-square integer sufficiently large in terms of cc.

Erdős–Graham–Granville–Selfridge conjecture. One has

tn≥(log⁡n)1−c.t_n\geq (\log n)^{1-c}.

This conjecture would strengthen the available lower bound for tnt_n beyond the case where the associated hyperelliptic polynomial has even degree. It is motivated by the expectation that the bound n≪tnO(tn)n\ll t_n^{O(t_n)} should also hold when the relevant number of factors is odd, and remains open in the stated generality.

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.