summaryrefslogtreecommitdiff
path: root/doc/coreutils.texi
diff options
context:
space:
mode:
Diffstat (limited to 'doc/coreutils.texi')
-rw-r--r--doc/coreutils.texi2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/coreutils.texi b/doc/coreutils.texi
index f40993ec1..73971c6a6 100644
--- a/doc/coreutils.texi
+++ b/doc/coreutils.texi
@@ -15470,7 +15470,7 @@ M8=`echo 2^31-1|bc` ; M9=`echo 2^61-1|bc`
Similarly, factoring the eighth Fermat number @math{2^{256}+1} takes
about 20 seconds on the same machine.
-Factoring large prime numbers is, in general, hard. The Pollard Rho
+Factoring large numbers is, in general, hard. The Pollard Rho
algorithm used by @command{factor} is particularly effective for
numbers with relatively small factors. If you wish to factor large
numbers which do not have small factors (for example, numbers which