Skip to content

Commit db65ec7

Browse files
committed
Update factorization.md
missed space
1 parent e905323 commit db65ec7

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/algebra/factorization.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ tags:
77

88
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.
99

10-
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 forFermat's factorization algorithm, Pollard's p-1.
10+
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.
1111
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.
1212

1313
## Trial division

0 commit comments

Comments
 (0)