Update factorization.md

adamant-pwn · adamant-pwn · commit 0410f4c6baa3 · 2024-02-23T22:32:53.000+01:00
add Pollard's rho
diff --git a/src/algebra/factorization.md b/src/algebra/factorization.md
@@ -7,7 +7,7 @@ tags:
 
 In this article we list several algorithms for the factorization of integers, each of which can be either fast or varying levels of slow depending on their input.
 
-Notice, if the number that you want to factorize is actually a prime number, most of the algorithms will run very slowly. This is especially true for Fermat's factorization algorithm, Pollard's p-1.
+Notice, if the number that you want to factorize is actually a prime number, most of the algorithms will run very slowly. This is especially true for Fermat's, Pollard's p-1 and Pollard's rho factorization algorithms.
 Therefore, it makes the most sense to perform a probabilistic (or a fast deterministic) [primality test](primality_tests.md) before trying to factorize the number.
 
 ## Trial division
