Involution (mathematics) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Involution (mathematics)" in English language version.

refsWebsite

Global rank English rank

3books.google.com

3^rd place

3^rd place

451^st place

277^th place

2^nd place

2^nd place

26^th place

20^th place

6^th place

6^th place

1airvectors.net

7,636^th place

6,829^th place

airvectors.net (Global: 7,636^th place; English: 6,829^th place)

vc.airvectors.net

Goebel, Greg (2018). "The Mechanization of Ciphers". Classical Cryptology.

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

mathscinet.ams.org

Knuth, Donald E. (1973), The Art of Computer Programming, Volume 3: Sorting and Searching, Reading, Mass.: Addison-Wesley, pp. 48, 65, MR 0445948
Zagier, D. (1990), "A one-sentence proof that every prime p ≡ 1 (mod 4) is a sum of two squares", American Mathematical Monthly, 97 (2): 144, doi:10.2307/2323918, JSTOR 2323918, MR 1041893.

archive.org (Global: 6^th place; English: 6^th place)

A.G. Pickford (1909) Elementary Projective Geometry, Cambridge University Press via Internet Archive

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

Russell, Bertrand (1903), Principles of mathematics (2nd ed.), W. W. Norton & Company, Inc, p. 426, ISBN 9781440054167 {{citation}}: ISBN / Date incompatibility (help)
Kubrusly, Carlos S. (2011), The Elements of Operator Theory, Springer Science & Business Media, Problem 1.11(a), p. 27, ISBN 9780817649982.
John S. Rose. "A Course on Group Theory". p. 10, section 1.13.

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

Zagier, D. (1990), "A one-sentence proof that every prime p ≡ 1 (mod 4) is a sum of two squares", American Mathematical Monthly, 97 (2): 144, doi:10.2307/2323918, JSTOR 2323918, MR 1041893.

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

Zagier, D. (1990), "A one-sentence proof that every prime p ≡ 1 (mod 4) is a sum of two squares", American Mathematical Monthly, 97 (2): 144, doi:10.2307/2323918, JSTOR 2323918, MR 1041893.