輾轉相除法 (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "輾轉相除法" in Chinese language version.

refsWebsite

Global rank Chinese rank

19archive.org

6^th place

4^th place

16doi.org

2^nd place

23^rd place

3loc.gov

70^th place

342^nd place

1wikisource.org

27^th place

30^th place

1web.archive.org

1^st place

1ntu.edu.tw

2,798^th place

141^st place

1wolfram.com

513^th place

358^th place

1sciencenews.org

3,410^th place

3,858^th place

1colorado.edu

2,526^th place

2,449^th place

1liu.se

9,195^th place

low place

1springerlink.com

2,569^th place

1,358^th place

1arxiv.org

69^th place

254^th place

1projecteuclid.org

3,707^th place

5,418^th place

archive.org

Anderson JA. Discrete Mathematics with Combinatorics. Upper Saddle River, NJ: Prentice Hall. 2001: 165–223. ISBN 0-13-086998-8.
Anderson JA. Discrete Mathematics with Combinatorics. Upper Saddle River, NJ: Prentice Hall. 2001: 109–119. ISBN 0-13-086998-8.
Kimberling C. A Visual Euclidean Algorithm. Mathematics Teacher. 1983, 76: 108–109.
van der Waerden BL. Science Awakening. translated by Arnold Dresden. Groningen: P. Noordhoff Ltd. 1954: 114–115.
von Fritz K. The Discovery of Incommensurability by Hippasus of Metapontum. Ann. Math. 1945, 46: 242–264. doi:10.2307/1969021.
Heath TL. Mathematics in Aristotle. Oxford Press. 1949: 80–83.
Fowler DH. The Mathematics of Plato's Academy: A New Reconstruction. Oxford: Oxford University Press. 1987: 31–66. ISBN 0-19-853912-6.
Cole AJ, Davie AJT. A game based on the Euclidean algorithm and a winning strategy for it. Math. Gaz. 1969, 53: 354–357. doi:10.2307/3612461.
Roberts J. Elementary Number Theory: A Problem Oriented Approach. Cambridge, MA: MIT Press. 1977: 1–8. ISBN 0-262-68028-9.
Crandall R, Pomerance C. Prime Numbers: A Computational Perspective 1st. New York: Springer-Verlag. 2001: 225–349. ISBN 0-387-94777-9.
Dixon JD. Asymptotically fast factorization of integers. Math. Comput. 1981, 36: 255–260. doi:10.2307/2007743.
Lenstra Jr. HW. Factoring integers with elliptic curves. Annals of Mathematics. 1987, 126: 649–673. doi:10.2307/1971363.
Grossman H. On the Number of Divisions in Finding a G.C.D.. The American Mathematical Monthly. 1924, 31: 443. doi:10.2307/2298146.
高德纳 DE. Evaluation of Porter's Constant. Computers and Mathematics with Applications. 1976, 2: 137–139. doi:10.1016/0898-1221(76)90025-0.
Crandall R, Pomerance C. Prime Numbers: A Computational Perspective 1st. New York: Springer-Verlag. 2001: 77–79, 81–85, 425–431. ISBN 0-387-94777-9.
Lehmer DH. Euclid's Algorithm for Large Numbers. The American Mathematical Monthly. 1938, 45: 227–233. doi:10.2307/2302607.
Cesari G. Parallel implementation of Schönhage's integer GCD algorithm. G. Buhler (编). Algorithmic Number Theory: Proc. ANTS-III, Portland, OR. New York: Springer-Verlag. 1998: 64–76. Volume 1423 in Lecture notes in Computer Science.
Cajori F. A History of Mathematics. New York: Macmillan. 1894: 70.
塞尔日·兰. Algebra 2nd. Menlo Park, CA: Addison–Wesley. 1984: 190–194. ISBN 0-201-05487-6.

arxiv.org

Yamada Y. Generalized rational blow-down, torus knots, and Euclidean algorithm. arXiv:0708.2316v1. 2007. 外部链接存在于|title= (帮助)

colorado.edu

amath.colorado.edu

Cipra BA. The Best of the 20th Century: Editors Name Top 10 Algorithms. SIAM News (Society for Industrial and Applied Mathematics). 16 May 2000, 33 (4). 外部链接存在于|title= (帮助)

doi.org

von Fritz K. The Discovery of Incommensurability by Hippasus of Metapontum. Ann. Math. 1945, 46: 242–264. doi:10.2307/1969021.
Cole AJ, Davie AJT. A game based on the Euclidean algorithm and a winning strategy for it. Math. Gaz. 1969, 53: 354–357. doi:10.2307/3612461.
Dixon JD. Asymptotically fast factorization of integers. Math. Comput. 1981, 36: 255–260. doi:10.2307/2007743.
Lenstra Jr. HW. Factoring integers with elliptic curves. Annals of Mathematics. 1987, 126: 649–673. doi:10.2307/1971363.
Grossman H. On the Number of Divisions in Finding a G.C.D.. The American Mathematical Monthly. 1924, 31: 443. doi:10.2307/2298146.
高德纳 DE. Evaluation of Porter's Constant. Computers and Mathematics with Applications. 1976, 2: 137–139. doi:10.1016/0898-1221(76)90025-0.
Dixon JD. The Number of Steps in the Euclidean Algorithm. J. Number Theory. 1970, 2: 414–422. doi:10.1016/0022-314X(70)90044-2.
Norton GH. On the Asymptotic Analysis of the Euclidean Algorithm. Journal of Symbolic Computation. 1990, 10: 53–58. doi:10.1016/S0747-7171(08)80036-3.
Stein J. Computational problems associated with Racah algebra. Journal of Computational Physics. 1967, 1: 397–405. doi:10.1016/0021-9991(67)90047-2.
Lehmer DH. Euclid's Algorithm for Large Numbers. The American Mathematical Monthly. 1938, 45: 227–233. doi:10.2307/2302607.
Sorenson J. Two fast GCD algorithms. J. Algorithms. 1994, 16: 110–144. doi:10.1006/jagm.1994.1006.
Weber K. The accelerated GCD algorithm. ACM Trans. Math. Soft. 1995, 21: 111–122. doi:10.1145/200979.201042.
Schönhage A. Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica. 1971, 1: 139–144. doi:10.1007/BF00289520.
Möller N. On Schönhage's algorithm and subquadratic integer gcd computation. Mathematics of Computation. 2008, 77: 589–607. doi:10.1090/S0025-5718-07-02017-0.
Clark DA. A quadratic field which is Euclidean but not norm-Euclidean. Manuscripta mathematica. 1994, 83: 327–330. doi:10.1007/BF02567617. 外部链接存在于|title= (帮助)
Jategaonkar AV. Rings with transfinite left division algorithm. Bull. Amer. Math. Soc. 1969, 75: 559–561. doi:10.1090/S0002-9904-1969-12242-1. 外部链接存在于|title= (帮助)

liu.se

lysator.liu.se

Möller N. On Schönhage's algorithm and subquadratic integer gcd computation. Mathematics of Computation. 2008, 77: 589–607. doi:10.1090/S0025-5718-07-02017-0.

loc.gov

lccn.loc.gov

Ogilvy CS, Anderson JT. Excursions in number theory. New York: Oxford University Press. 1966: 27–29.
LCCN 66-0 – 0
.
Stewart BM. Theory of Numbers 2nd. New York: Macmillan. 1964: 43–44.
LCCN 64-0 – 0
.
Heilbronn HA. On the Average Length of a Class of Finite Continued Fractions. Paul Turán (编). Number Theory and Analysis. New York: Plenum. 1969: 87–96.
LCCN 68-0 – 00
.

ntu.edu.tw

episte.math.ntu.edu.tw

洪萬生. 中國π的一頁滄桑. [2015-04-28]. （原始内容存档于2016-03-05）.

projecteuclid.org

Jategaonkar AV. Rings with transfinite left division algorithm. Bull. Amer. Math. Soc. 1969, 75: 559–561. doi:10.1090/S0002-9904-1969-12242-1. 外部链接存在于|title= (帮助)

sciencenews.org

Peterson I. Jazzing Up Euclid's Algorithm. ScienceNews. 12 August 2002. 外部链接存在于|title= (帮助)

springerlink.com

Clark DA. A quadratic field which is Euclidean but not norm-Euclidean. Manuscripta mathematica. 1994, 83: 327–330. doi:10.1007/BF02567617. 外部链接存在于|title= (帮助)

web.archive.org

洪萬生. 中國π的一頁滄桑. [2015-04-28]. （原始内容存档于2016-03-05）.

wikisource.org

zh.wikisource.org

九章算术. 维基文库（中文）. 可半者半之；不可半者，副置分母、子之數，以少減多，更相減損，求其等也。以等數約之。

wolfram.com

mathworld.wolfram.com

Weisstein, Eric W. (编). Integer Relation. at MathWorld--A Wolfram Web Resource. Wolfram Research, Inc. （英语）.