Record
- Authors
- Rabin, M. O.
- Year
- 1980
- Title
- Probabilistic algorithm for testing primality
- Published in
- Journal of Number Theory
- Volume
- 12 (1)
- Pages
- 128–138
- Type
- Journal article
- Our note
- none yet
- Verification
- matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W1998777945 · DOI 10.1016/0022-314x(80)90084-0 - Id
rabin-1980-probabilistic-algorithm-testing-primality
Cited on
- Fermat's Little Theorem read status: not stated
As cited
The pages cite this work in one form.
-
Rabin, M. O. (1980). Probabilistic algorithm for testing primality. Journal of Number Theory, 12(1), 128–138. Cited for attribution only, through Conrad (n.d.): the bound of one quarter on the proportion of bases that an odd composite passes.
BibLaTeX
@article{rabin-1980-probabilistic-algorithm-testing-primality,
author = {Rabin, M. O.},
title = {{Probabilistic algorithm for testing primality}},
journaltitle = {Journal of Number Theory},
date = {1980},
volume = {12},
number = {1},
pages = {128--138}
}