diff options
| author | Jim Meyering <meyering@redhat.com> | 2010-04-25 10:35:51 +0200 |
|---|---|---|
| committer | Jim Meyering <meyering@redhat.com> | 2010-04-25 10:35:51 +0200 |
| commit | 83e4f0ca0224e9d3f628d6f1364ce49393a7af04 (patch) | |
| tree | 08b20371abe73668e805af740d31c569ecafbc08 /doc | |
| parent | 2191fe8f8d84e39f8c4b861cde28d395639393e1 (diff) | |
| download | coreutils-83e4f0ca0224e9d3f628d6f1364ce49393a7af04.tar.xz | |
doc: tweak factor-describing wording
* doc/coreutils.texi (factor invocation): Don't say that "factoring
large prime numbers is hard". A pedant might ding you, since it's
trivial to factor a number that is known to be prime. Instead, say
that "factoring large numbers... is hard". Reported by Andreas Eder.
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/coreutils.texi | 2 |
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 |