Jump to content

Want site search autocompletion? See here
Encountering 429 Too Many Requests errors when browsing the site? See here

Toggle the table of contents

Pillai's lower bound on the least primitive root

From Number

Revision as of 22:58, 29 May 2010 by Vipul (talk | contribs) (Created page with '==History== This result was established by S. Pilai in 1944. ==Statement== There are infinitely many prime numbers <math>p</math> for which the [[fact about::least primiti…')

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

History

This result was established by S. Pilai in 1944.

Statement

There are infinitely many prime numbers $p$ for which the least primitive root modulo $p$ is greater than the double logarithm $\log \log p$ .

Retrieved from "https://number.subwiki.org/w/index.php?title=Pillai%27s_lower_bound_on_the_least_primitive_root&oldid=545"