Greatest common divisor (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Greatest common divisor" in English language version.

refsWebsite

Global rank English rank

4books.google.com

3^rd place

4doi.org

2^nd place

2loc.gov

70^th place

63^rd place

2integers-ejcnt.org

low place

2semanticscholar.org

11^th place

8^th place

1wolframalpha.com

4,660^th place

5,295^th place

1wolfram.com

513^th place

537^th place

1mathsisfun.com

6,108^th place

4,433^rd place

1berkeley.edu

580^th place

462^nd place

1web.archive.org

1^st place

1harvard.edu

18^th place

17^th place

berkeley.edu (Global: 580^th place; English: 462^nd place)

icsi.berkeley.edu

Shallcross, D.; Pan, V.; Lin-Kriz, Y. (1993). "The NC equivalence of planar integer linear programming and Euclidean GCD" (PDF). 34th IEEE Symp. Foundations of Computer Science. pp. 557–564. Archived (PDF) from the original on 2006-09-05.

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

Kelley, W. Michael (2004). The Complete Idiot's Guide to Algebra. Penguin. p. 142. ISBN 978-1-59257-161-1..
Jones, Allyn (1999). Whole Numbers, Decimals, Percentages and Fractions Year 7. Pascal Press. p. 16. ISBN 978-1-86441-378-6..
Barlow, Peter; Peacock, George; Lardner, Dionysius; Airy, Sir George Biddell; Hamilton, H. P.; Levy, A.; De Morgan, Augustus; Mosley, Henry (1847). Encyclopaedia of Pure Mathematics. R. Griffin and Co. p. 589..
Some authors use $(a, b)$ ,^[1]^[2]^[5] but this notation is often ambiguous. Andrews (1994, p. 16) explains this as: "Many authors write $(a, b)$ for $g.c.d.(a, b)$ . We do not, because we shall often use $(a, b)$ to represent a point in the Euclidean plane." Andrews, George E. (1994) [1971]. Number Theory. Dover. ISBN 978-0-486-68252-5.

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

Chor, B.; Goldreich, O. (1990). "An improved parallel algorithm for integer GCD". Algorithmica. 5 (1–4): 1–10. doi:10.1007/BF01840374. S2CID 17699330.
Adleman, L. M.; Kompella, K. (1988). "Using smoothness to achieve parallelism". 20th Annual ACM Symposium on Theory of Computing. New York. pp. 528–538. doi:10.1145/62212.62264. ISBN 0-89791-264-0. S2CID 9118047.
Nymann, J. E. (1972). "On the probability that $k$ positive integers are relatively prime". Journal of Number Theory. 4 (5): 469–473. Bibcode:1972JNT.....4..469N. doi:10.1016/0022-314X(72)90038-8.
Chidambaraswamy, J.; Sitarmachandrarao, R. (1987). "On the probability that the values of m polynomials have a given g.c.d." Journal of Number Theory. 26 (3): 237–245. doi:10.1016/0022-314X(87)90081-3.

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

ui.adsabs.harvard.edu

Nymann, J. E. (1972). "On the probability that $k$ positive integers are relatively prime". Journal of Number Theory. 4 (5): 469–473. Bibcode:1972JNT.....4..469N. doi:10.1016/0022-314X(72)90038-8.

integers-ejcnt.org (Global: low place; English: low place)

Slavin, Keith R. (2008). "Q-Binomials and the Greatest Common Divisor". INTEGERS: The Electronic Journal of Combinatorial Number Theory. 8. University of West Georgia, Charles University in Prague: A5. Retrieved 2008-05-26.
Schramm, Wolfgang (2008). "The Fourier transform of functions of the greatest common divisor". INTEGERS: The Electronic Journal of Combinatorial Number Theory. 8. University of West Georgia, Charles University in Prague: A50. Retrieved 2008-11-25.

loc.gov (Global: 70^th place; English: 63^rd place)

lccn.loc.gov

Long (1972, p. 33) Long, Calvin T. (1972). Elementary Introduction to Number Theory (2nd ed.). Lexington: D. C. Heath and Company. LCCN 77171950.
Pettofrezzo & Byrkit (1970, p. 34) Pettofrezzo, Anthony J.; Byrkit, Donald R. (1970). Elements of Number Theory. Englewood Cliffs: Prentice Hall. LCCN 71081766.

mathsisfun.com (Global: 6,108^th place; English: 4,433^rd place)

"Greatest Common Factor". www.mathsisfun.com. Retrieved 2020-08-30.

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

api.semanticscholar.org

Chor, B.; Goldreich, O. (1990). "An improved parallel algorithm for integer GCD". Algorithmica. 5 (1–4): 1–10. doi:10.1007/BF01840374. S2CID 17699330.
Adleman, L. M.; Kompella, K. (1988). "Using smoothness to achieve parallelism". 20th Annual ACM Symposium on Theory of Computing. New York. pp. 528–538. doi:10.1145/62212.62264. ISBN 0-89791-264-0. S2CID 9118047.

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

Shallcross, D.; Pan, V.; Lin-Kriz, Y. (1993). "The NC equivalence of planar integer linear programming and Euclidean GCD" (PDF). 34th IEEE Symp. Foundations of Computer Science. pp. 557–564. Archived (PDF) from the original on 2006-09-05.

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

mathworld.wolfram.com

Weisstein, Eric W. "Greatest Common Divisor". mathworld.wolfram.com. Retrieved 2020-08-30.

wolframalpha.com (Global: 4,660^th place; English: 5,295^th place)

e.g., Wolfram Alpha calculation and Maxima

Greatest common divisor (English Wikipedia)

berkeley.edu (Global: 580th place; English: 462nd place)

icsi.berkeley.edu

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

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

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