OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Pocklington's algorithm

 Home Mathematics Fields of mathematics Arithmetic Modular arithmetic
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Pocklington's algorithm is a method used to test the primality of large integers. It was developed by the mathematician Henry Pocklington in 1914 and is particularly effective for numbers that can be represented in a specific form. The algorithm is based on the properties of prime numbers and relies on certain mathematical theorems related to divisibility and modular arithmetic.

 Ancestors (5)

  1. Modular arithmetic
  2. Arithmetic
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook