Primitive root modulo n (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Primitive root modulo n" in English language version.

refsWebsite

Global rank English rank

4doi.org

2^nd place

4books.google.com

3^rd place

2wolfram.com

513^th place

537^th place

2worldcat.org

5^th place

1psu.edu

207^th place

136^th place

1ams.org

451^st place

277^th place

1semanticscholar.org

11^th place

8^th place

1encyclopediaofmath.org

3,863^rd place

2,637^th place

1web.archive.org

1^st place

1brynmawr.edu

7,099^th place

4,646^th place

1oeis.org

742^nd place

538^th place

1wiley.com

222^nd place

297^th place

1jstor.org

26^th place

20^th place

1bbc.co.uk

8^th place

10^th place

1harvard.edu

18^th place

17^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

"One of the most important unsolved problems in the theory of finite fields is designing a fast algorithm to construct primitive roots. von zur Gathen & Shparlinski 1998, pp. 15–24 von zur Gathen, Joachim; Shparlinski, Igor (1998). "Orders of Gauss periods in finite fields". Applicable Algebra in Engineering, Communication and Computing. 9 (1): 15–24. CiteSeerX 10.1.1.46.5504. doi:10.1007/s002000050093. MR 1624824. S2CID 19232025.

bbc.co.uk (Global: 8^th place; English: 10^th place)

downloads.bbc.co.uk

Walker, R. (1990). The design and application of modular acoustic diffusing elements (PDF). BBC Research Department (Report). British Broadcasting Corporation. Retrieved 25 March 2019.

books.google.com (Global: 3^rd place; English: 3^rd place)

"There is no convenient formula for computing [the least primitive root]." Robbins 2006, p. 159 Robbins, Neville (2006). Beginning Number Theory. Jones & Bartlett Learning. ISBN 978-0-7637-3768-9.
(Vinogradov 2003, pp. 105–121, § VI PRIMITIVE ROOTS AND INDICES) Vinogradov, I.M. (2003). "§ VI Primitive roots and indices". Elements of Number Theory. Mineola, NY: Dover Publications. pp. 105–121. ISBN 978-0-486-49530-9.
Vinogradov 2003, pp. 105–121, § VI Primitive roots and indices. Vinogradov, I.M. (2003). "§ VI Primitive roots and indices". Elements of Number Theory. Mineola, NY: Dover Publications. pp. 105–121. ISBN 978-0-486-49530-9.
Vinogradov 2003, p. 106. Vinogradov, I.M. (2003). "§ VI Primitive roots and indices". Elements of Number Theory. Mineola, NY: Dover Publications. pp. 105–121. ISBN 978-0-486-49530-9.

brynmawr.edu (Global: 7,099^th place; English: 4,646^th place)

Stromquist, Walter. "What are primitive roots?". Mathematics. Bryn Mawr College. Archived from the original on 2017-07-03. Retrieved 2017-07-03.

doi.org (Global: 2^nd place; English: 2^nd place)

"One of the most important unsolved problems in the theory of finite fields is designing a fast algorithm to construct primitive roots. von zur Gathen & Shparlinski 1998, pp. 15–24 von zur Gathen, Joachim; Shparlinski, Igor (1998). "Orders of Gauss periods in finite fields". Applicable Algebra in Engineering, Communication and Computing. 9 (1): 15–24. CiteSeerX 10.1.1.46.5504. doi:10.1007/s002000050093. MR 1624824. S2CID 19232025.
Burgess, D. A. (1962). "On Character Sums and Primitive Roots †". Proceedings of the London Mathematical Society. s3-12 (1): 179–192. doi:10.1112/plms/s3-12.1.179.
Grosswald, E. (1981). "On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)". American Journal of Mathematics. 103 (6): 1171–1183. doi:10.2307/2374229. ISSN 0002-9327. JSTOR 2374229.
Feldman, Eliot (July 1995). "A reflection grating that nullifies the specular reflection: A cone of silence". J. Acoust. Soc. Am. 98 (1): 623–634. Bibcode:1995ASAJ...98..623F. doi:10.1121/1.413656.

encyclopediaofmath.org (Global: 3,863^rd place; English: 2,637^th place)

"Primitive root - Encyclopedia of Mathematics". encyclopediaofmath.org. Retrieved 2024-11-05.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Feldman, Eliot (July 1995). "A reflection grating that nullifies the specular reflection: A cone of silence". J. Acoust. Soc. Am. 98 (1): 623–634. Bibcode:1995ASAJ...98..623F. doi:10.1121/1.413656.

jstor.org (Global: 26^th place; English: 20^th place)

Grosswald, E. (1981). "On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)". American Journal of Mathematics. 103 (6): 1171–1183. doi:10.2307/2374229. ISSN 0002-9327. JSTOR 2374229.

oeis.org (Global: 742^nd place; English: 538^th place)

(sequence A010554 in the OEIS)

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

"One of the most important unsolved problems in the theory of finite fields is designing a fast algorithm to construct primitive roots. von zur Gathen & Shparlinski 1998, pp. 15–24 von zur Gathen, Joachim; Shparlinski, Igor (1998). "Orders of Gauss periods in finite fields". Applicable Algebra in Engineering, Communication and Computing. 9 (1): 15–24. CiteSeerX 10.1.1.46.5504. doi:10.1007/s002000050093. MR 1624824. S2CID 19232025.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

"One of the most important unsolved problems in the theory of finite fields is designing a fast algorithm to construct primitive roots. von zur Gathen & Shparlinski 1998, pp. 15–24 von zur Gathen, Joachim; Shparlinski, Igor (1998). "Orders of Gauss periods in finite fields". Applicable Algebra in Engineering, Communication and Computing. 9 (1): 15–24. CiteSeerX 10.1.1.46.5504. doi:10.1007/s002000050093. MR 1624824. S2CID 19232025.

web.archive.org (Global: 1^st place; English: 1^st place)

Stromquist, Walter. "What are primitive roots?". Mathematics. Bryn Mawr College. Archived from the original on 2017-07-03. Retrieved 2017-07-03.

wiley.com (Global: 222^nd place; English: 297^th place)

doi.wiley.com

Burgess, D. A. (1962). "On Character Sums and Primitive Roots †". Proceedings of the London Mathematical Society. s3-12 (1): 179–192. doi:10.1112/plms/s3-12.1.179.

wolfram.com (Global: 513^th place; English: 537^th place)

mathworld.wolfram.com

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Grosswald, E. (1981). "On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)". American Journal of Mathematics. 103 (6): 1171–1183. doi:10.2307/2374229. ISSN 0002-9327. JSTOR 2374229.
Gentle, James E. (2003). Random number generation and Monte Carlo methods (2nd ed.). New York: Springer. ISBN 0-387-00178-6. OCLC 51534945.

Primitive root modulo n (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

bbc.co.uk (Global: 8th place; English: 10th place)

downloads.bbc.co.uk

books.google.com (Global: 3rd place; English: 3rd place)

brynmawr.edu (Global: 7,099th place; English: 4,646th place)

doi.org (Global: 2nd place; English: 2nd place)

encyclopediaofmath.org (Global: 3,863rd place; English: 2,637th place)

harvard.edu (Global: 18th place; English: 17th place)