From 8debb843b670d81393536273d1e1519ebd6dfdd6 Mon Sep 17 00:00:00 2001 From: Jim Meyering Date: Sat, 8 Apr 2000 19:28:49 +0000 Subject: (factor): Use a better example --- doc/sh-utils.texi | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) (limited to 'doc') diff --git a/doc/sh-utils.texi b/doc/sh-utils.texi index bb7bdb2ec..318da5139 100644 --- a/doc/sh-utils.texi +++ b/doc/sh-utils.texi @@ -3201,12 +3201,13 @@ options}. The algorithm it uses is not very sophisticated, so for some inputs @code{factor} runs for a long time. The hardest numbers to factor are -the products of large primes. Factoring the square of the largest 32-bit -prime number takes over 10 minutes of CPU time on a 400MHz Pentium II. +the products of large primes. Factoring the product of the two largest 32-bit +prime numbers takes over 10 minutes of CPU time on a 400MHz Pentium II. @example -$ factor `echo '4294967291^2'|bc` -18446744030759878681: 4294967291 4294967291 +$ p=`echo '4294967279 4294967291*p'|dc` +$ factor $p +18446743979220271189: 4294967279 4294967291 @end example In contrast, @code{factor} factors the largest 64-bit number in just -- cgit v1.2.3-70-g09d2