1.\" $OpenBSD: factor.6,v 1.13 2015/12/30 14:07:53 tb Exp $ 2.\" 3.\" Copyright (c) 1989, 1993 4.\" The Regents of the University of California. All rights reserved. 5.\" 6.\" This code is derived from software contributed to Berkeley by 7.\" Landon Curt Noll. 8.\" 9.\" Redistribution and use in source and binary forms, with or without 10.\" modification, are permitted provided that the following conditions 11.\" are met: 12.\" 1. Redistributions of source code must retain the above copyright 13.\" notice, this list of conditions and the following disclaimer. 14.\" 2. Redistributions in binary form must reproduce the above copyright 15.\" notice, this list of conditions and the following disclaimer in the 16.\" documentation and/or other materials provided with the distribution. 17.\" 3. Neither the name of the University nor the names of its contributors 18.\" may be used to endorse or promote products derived from this software 19.\" without specific prior written permission. 20.\" 21.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31.\" SUCH DAMAGE. 32.\" 33.\" @(#)factor.6 8.1 (Berkeley) 5/31/93 34.\" 35.\" 36.\" By: Landon Curt Noll chongo@toad.com, ...!{sun,tolsoft}!hoptoad!chongo 37.\" 38.\" chongo <for a good prime call: 391581 * 2^216193 - 1> /\oo/\ 39.\" 40.Dd $Mdocdate: December 30 2015 $ 41.Dt FACTOR 6 42.Os 43.Sh NAME 44.Nm factor , 45.Nm primes 46.Nd factor a number, generate primes 47.Sh SYNOPSIS 48.Nm factor 49.Op Ar number ... 50.Nm primes 51.Op Ar start Op Ar stop 52.Sh DESCRIPTION 53The 54.Nm 55utility will factor 64-bit positive integers. 56When a number is factored, it is printed, followed by a 57.Sq \&: , 58and the list of its prime factors in ascending order, on a single line. 59Every prime factor is printed as often as it divides the number. 60.Pp 61When 62.Nm 63is invoked with one or more arguments, 64each argument will be factored. 65.Pp 66When 67.Nm 68is invoked with no arguments, 69.Nm 70reads numbers, one per line, from standard input, until end of file or error. 71White-space and empty lines are ignored. 72Numbers may be preceded by a single +. 73After a number is read, it is factored. 74Input lines must not be longer than 99 characters. 75.Pp 76The 77.Nm primes 78utility prints primes in ascending order, one per line, starting at or above 79.Ar start 80and continuing until, but not including 81.Ar stop . 82The 83.Ar start 84value must be at least 0 and not greater than 85.Ar stop . 86The 87.Ar stop 88value must not be greater than 4294967295. 89The default value of 90.Ar stop 91is 4294967295. 92.Pp 93When the 94.Nm primes 95utility is invoked with no arguments, 96.Ar start 97is read from standard input. 98.Ar stop 99is taken to be 4294967295. 100The 101.Ar start 102value may be preceded by a single +. 103The input line must not be longer than 99 characters. 104.Sh BUGS 105.Nm factor 106cannot handle the 107.Dq 10 most wanted 108factor list; 109.Nm primes 110won't get you a world record. 111