Template:Number-theoretic algorithms: Difference between revisions

Revision as of 15:36, 27 November 2015

Revision as of 15:46, 27 November 2015

Line 9:

* {{smallcaps|[[AKS primality test|AKS test]]}}

* {{smallcaps|[[Adleman–Pomerance–Rumely primality test|APR test]]}}

* {{smallcaps[[Baillie–PSW primality test|Baillie–PSW]]}}

* {{smallcaps|[[Elliptic curve primality proving|ECPP test]]}}

* {{smallcaps[[Elliptic curve primality |Elliptic curve]]}}

* {{smallcaps[[Pocklington primality test|Pocklington]]}}

* {{smallcaps[[Fermat primality test|Fermat]]}}

* {{smallcaps[[Lucas primality test|Lucas]]}}

* {{smallcaps|''[[Lucas–Lehmer primality test|Lucas–Lehmer]]''}}

* {{smallcaps|''[[Lucas–Lehmer–Riesel test|Lucas–Lehmer–Riesel]]''}}

* {{smallcaps|''[[Proth's theorem]]''}}

* {{smallcaps|''[[Pépin's test|Pépin's]]''}}

* {{smallcaps[[Quadratic Frobenius test]]}}

* {{smallcaps[[Solovay–Strassen primality test|Solovay–Strassen]]}}

* {{smallcaps[[Miller–Rabin primality test|Miller–Rabin]]}}

| group2 = [[Generating primes|Prime-generating]]