Annotation of lucent/sys/man/1/factor, revision 1.1.1.1

1.1       root        1: .TH FACTOR 1 
                      2: .CT 1 numbers
                      3: .SH NAME
                      4: factor, primes \- factor a number, generate large primes
                      5: .SH SYNOPSIS
                      6: .B factor
                      7: [
                      8: .I number
                      9: ]
                     10: .PP
                     11: .B primes
                     12: [
                     13: .I start
                     14: [
                     15: .I finish
                     16: ]
                     17: ]
                     18: .SH DESCRIPTION
                     19: .I Factor
                     20: prints
                     21: .I number
                     22: and its prime factors,
                     23: each repeated the proper number of times.
                     24: The number must be positive and less than
                     25: .if n 2**56
                     26: .if t 2\u\s756\s0\d
                     27: (about
                     28: .if n 7.2e16)
                     29: .if t 7.2\(mu10\u\s716\s0\d\|).
                     30: .PP
                     31: If no
                     32: .I number 
                     33: is given,
                     34: .I factor
                     35: 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 to
                     38: .if n sqrt(n).
                     39: .if t .I \(sr\o'n\(rn'\f1.
                     40: .PP
                     41: .ig
                     42: .I Lfactor
                     43: reads one number from the standard input and factors it.
                     44: Worst-case running time is proportional to
                     45: .if n .IR n **(1/5);
                     46: .if t .IR n \u\s-21/5\s0\d;
                     47: it beats
                     48: .I factor
                     49: for hard 12-digit problems and is workable to around
                     50: .if n .IR n =10**30.
                     51: .if t .IR n =10\u\s-230\s0\d.
                     52: ..
                     53: .PP
                     54: .I Primes
                     55: prints the prime numbers ranging from
                     56: .I start
                     57: to
                     58: .IR finish ,
                     59: where
                     60: .I start
                     61: and
                     62: .I finish
                     63: are positive numbers less than 
                     64: .if n 2**56.
                     65: .if t 2\u\s756\s0\d.
                     66: If 
                     67: .I finish
                     68: is missing,
                     69: .I primes
                     70: prints without end;
                     71: if
                     72: .I start
                     73: is missing, it reads the starting number from the
                     74: standard input.
                     75: .SH SOURCE
                     76: .B /sys/src/cmd/factor.c
                     77: .br
                     78: .B /sys/src/cmd/primes.c

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.