.TH FACTOR 1 | |

.CT 1 numbers | |

.SH NAME | |

factor, primes \- factor a number, generate large primes | |

.SH SYNOPSIS | |

.B factor | |

[ | |

.I number | |

] | |

.PP | |

.B primes | |

[ | |

.I start | |

[ | |

.I finish | |

] | |

] | |

.SH DESCRIPTION | |

.I Factor | |

prints | |

.I number | |

and its prime factors, | |

each repeated the proper number of times. | |

The number must be positive and less than | |

.if n 2**54 | |

.if t 2\u\s754\s0\d | |

(about | |

.if n 1.8e16) | |

.if t 1.8\(mu10\u\s716\s0\d\|). | |

.PP | |

If no | |

.I number | |

is given, | |

.I factor | |

reads a stream of numbers from the standard input and factors them. | |

It exits on any input not a positive integer. | |

Maximum running time is proportional to | |

.if n sqrt(n). | |

.if t .I \(sr\o'n\(rn'\f1. | |

.PP | |

.PP | |

.I Primes | |

prints the prime numbers ranging from | |

.I start | |

to | |

.IR finish , | |

where | |

.I start | |

and | |

.I finish | |

are positive numbers less than | |

.if n 2**56. | |

.if t 2\u\s756\s0\d. | |

If | |

.I finish | |

is missing, | |

.I primes | |

prints without end; | |

if | |

.I start | |

is missing, it reads the starting number from the | |

standard input. | |

.SH SOURCE | |

.B \*9/src/cmd/factor.c | |

.br | |

.B \*9/src/cmd/primes.c |