Miller–Rabin primality test
Miller–Rabin primality test
Uncommon
Rarity: Uncommon
A topic a little better known than average, read and translated beyond its own country.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
The Miller–Rabin primality test or Rabin–Miller primality test is a probabilistic primality test: an algorithm which determines whether a given number is likely to be prime, similar to the Fermat primality test and the Solovay–Strassen primality test.
Excerpt from the Wikipedia article “Miller–Rabin primality test”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Open free boosters and add Miller–Rabin primality test to your collection.
Play for free

