ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p≥3p\geq 3 be prime, let γ,e2,e3∈{1,…,p−2}\gamma,e_2,e_3\in\{1,\ldots,p-2\} satisfy e3>e2>0e_3>e_2>0 and gcd⁡(e2,e3,p−1)=1\gcd(e_2,e_3,p-1)=1, and consider the trinomial

γ+xe2+xe3.\gamma+x^{e_2}+x^{e_3}.

Polylogarithmic root-bound conjecture. There is an absolute constant c≥1c\geq 1 such that this trinomial has no more than (log⁡p)c(\log p)^c roots in Fp\mathbb{F}_p.

This conjecture proposes an upper bound for the number of roots of normalized trinomials over prime finite fields, in contrast with the experimentally motivated possibility of trinomials having on the order of p\sqrt p roots. Its status is not resolved by the supplied source context.

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.