Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the smallest simultaneous power nonresidue modulo a prime

Published 26 Nov 2015 in math.NT | (1511.08428v1)

Abstract: Let $p$ be a prime and $p_1,\ldots, p_r$ be distinct prime divisors of $p-1$. We prove that the smallest positive integer $n$ which is a simultaneous $p_1,\ldots,p_r$-power nonresidue modulo $p$ satisfies $$ n<p{1/4 - c_r+o(1)}\quad(p\to\infty) $$ for some positive $c_r$ satisfying $c_r\ge e{-(1+o(1))r} \; (r\to \infty).$

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.