Sign In

Login

Password

Forgot Password ? Sign Up

Fermat primality test (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Fermat primality test" in English language version.

refsWebsite
Global rank English rank
2dartmouth.edu
2,242nd place
1,513th place
2doi.org
2nd place
2nd place
2jstor.org
26th place
20th place
1ams.org
451st place
277th place
1github.com
383rd place
320th place
1t5k.org
low place
low place
1mersenneforum.org
low place
low place
1psu.edu
207th place
136th place
1arxiv.org
69th place
59th place

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

mathscinet.ams.org

  • Paul Erdős (1956). "On pseudoprimes and Carmichael numbers". Publ. Math. Debrecen. 4: 201–206. MR 0079031.

arxiv.org (Global: 69th place; English: 59th place)

dartmouth.edu (Global: 2,242nd place; English: 1,513th place)

math.dartmouth.edu

  • Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·109" (PDF). Mathematics of Computation. 35 (151): 1003–1026. doi:10.1090/S0025-5718-1980-0572872-7. JSTOR 2006210.
  • Alford, W. R.; Granville, Andrew; Pomerance, Carl (1994). "There are Infinitely Many Carmichael Numbers" (PDF). Annals of Mathematics. 140 (3): 703–722. doi:10.2307/2118576. JSTOR 2118576.

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

  • Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·109" (PDF). Mathematics of Computation. 35 (151): 1003–1026. doi:10.1090/S0025-5718-1980-0572872-7. JSTOR 2006210.
  • Alford, W. R.; Granville, Andrew; Pomerance, Carl (1994). "There are Infinitely Many Carmichael Numbers" (PDF). Annals of Mathematics. 140 (3): 703–722. doi:10.2307/2118576. JSTOR 2118576.

github.com (Global: 383rd place; English: 320th place)

  • "primenet.h". There are (at least) 5 PRP residue types for testing N=(k*b^n+c)/d: (1) Fermat PRP. Calculate a^(N-1) mod N. PRP if result = 1. (2) SPRP variant. Calculate a^((N-1)/2) mod N. PRP if result = +/-1. (3) Type 1 variant,b=2,d=1. Calculate a^(N-c) mod N. PRP if result = a^-(c-1). (4) Type 2 variant,b=2,d=1. Calculate a^((N-c)/2) mod N. PRP if result = +/-a^-((c-1)/2). (5) Cofactor variant. Calculate a^(N*d-1) mod N*d. PRP if result = a^(d-1) mod N.

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

  • Carl Pomerance; John L. Selfridge; Samuel S. Wagstaff, Jr. (July 1980). "The pseudoprimes to 25·109" (PDF). Mathematics of Computation. 35 (151): 1003–1026. doi:10.1090/S0025-5718-1980-0572872-7. JSTOR 2006210.
  • Alford, W. R.; Granville, Andrew; Pomerance, Carl (1994). "There are Infinitely Many Carmichael Numbers" (PDF). Annals of Mathematics. 140 (3): 703–722. doi:10.2307/2118576. JSTOR 2118576.

mersenneforum.org (Global: low place; English: low place)

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

citeseerx.ist.psu.edu

t5k.org (Global: low place; English: low place)