Abstract
In this paper it is shown that the number of pairs of consecutive primitive roots modulo p is asymptotic to (p − 2)( ϕ(p − 1) (p − 1) ) 2 , and that, for all sufficiently large primes p, there is at least one pair of consecutive primitive roots modulo p. The theorem proved here is a generalization of this proposition. Another one is mentioned in the remarks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
