Template:Number-theoretic algorithms: Difference between revisions

Revision as of 22:03, 11 January 2021

Latest revision as of 06:37, 8 May 2025

(13 intermediate revisions by 9 users not shown)

Line 14:

* [[Fermat primality test|Fermat]]

* [[Lucas primality test|Lucas]]

* ''[[Lucas–Lehmer primality test|Lucas–Lehmer]]''

* ''[[Lucas–Lehmer–Riesel test|Lucas–Lehmer–Riesel]]''

* ''[[Proth's theorem]]''

* [[n −1 primality test|''n'' − 1]]

* ''[[n + 1 primalityPépin's test|Pépin's]]'n'' + 1]]

* [[Proth's theorem]]

* [[Pépin's test|Pépin's]]

* [[Quadratic Frobenius test|Quadratic Frobenius]]

* [[Solovay–Strassen primality test|Solovay–Strassen]]

Line 28 ⟶ 26:

* [[Sieve of Atkin]]

* [[Sieve of Eratosthenes]]

* [[Sieve of Pritchard]]

* [[Sieve of Sundaram]]

* [[Wheel factorization]]

Line 99 ⟶ 98:

* [[Exponentiation by squaring]]

* [[Integer square root]]

* [[Integer relation algorithm|Integer relation]] ([[Lenstra–Lenstra–Lovász lattice basis reduction algorithm|LLL]]; [[Korkine–Zolotarev lattice basis reduction algorithm|KZ]])

* [[Modular exponentiation]]

* [[Montgomery reduction]]

* [[Schoof's algorithm|Schoof]]

* [[Trachtenberg system]]

Line 115:

[[Category:Computer science navigational boxes]]

[[Category:MathematicsNumber theory navigational boxes]]

}}

</noinclude>