Blob
1 .TH FACTOR 12 .CT 1 numbers3 .SH NAME4 factor, primes \- factor a number, generate large primes5 .SH SYNOPSIS6 .B factor7 [8 .I number9 ]10 .PP11 .B primes12 [13 .I start14 [15 .I finish16 ]17 ]18 .SH DESCRIPTION19 .I Factor20 prints21 .I number22 and its prime factors,23 each repeated the proper number of times.24 The number must be positive and less than25 .if n 2**5426 .if t 2\u\s754\s0\d27 (about28 .if n 1.8e16)29 .if t 1.8\(mu10\u\s716\s0\d\|).30 .PP31 If no32 .I number33 is given,34 .I factor35 reads a stream of numbers from the standard input and factors them.36 It exits on any input not a positive integer.37 Maximum running time is proportional to38 .if n sqrt(n).39 .if t .I \(sr\o'n\(rn'\f1.40 .PP41 .PP42 .I Primes43 prints the prime numbers ranging from44 .I start45 to46 .IR finish ,47 where48 .I start49 and50 .I finish51 are positive numbers less than52 .if n 2**56.53 .if t 2\u\s756\s0\d.54 If55 .I finish56 is missing,57 .I primes58 prints without end;59 if60 .I start61 is missing, it reads the starting number from the62 standard input.63 .SH SOURCE64 .B /usr/local/plan9/src/cmd/factor.c65 .br66 .B /usr/local/plan9/src/cmd/primes.c