Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant

Details Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant

2011-04-23

arxiv.org/abs/1104.4557v1

Mathematics

Number Theory

11 pages

Scientific paper

We give a new elementary proof of the fact that the value of the least $k^{th}$ power non-residue in an arithmetic progression $\{bn+c\}_{n=0,1...}$, over a prime field $\F_p$, is bounded by $7/\sqrt{5} \cdot b \cdot \sqrt{p/k} + 4b + c$. Our proof is inspired by the so called \emph{Stepanov method}, which involves bounding the size of the solution set of a system of equations by constructing a non-zero low degree auxiliary polynomial that vanishes with high multiplicity on the solution set. The proof uses basic algebra and number theory along with a determinant identity that generalizes both the Sylvester and the Vandermonde determinant.

Affiliated with

Also associated with

No associations

Rating

Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484232