2000 character limit reached
Behaviour of the least root modulo a prime of a polynomial
Published 11 Jun 2017 in math.NT | (1706.03300v1)
Abstract: For a polynomial $f(x)\in\mathbb Z[x]$ without non-trivial linear relations among roots, we propose a conjecture on the distribution of the least root $r_p$ ($r_p\in\mathbb Z,\,0\le r_p<p)$ of $f(x)\equiv0\bmod p$ where $p$ runs over the set of primes such that $f(x)$ modulo $p$ is fully splitting.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.