primes(6) [debian man page]

PRIMES(6)							 BSD Games Manual							 PRIMES(6)

NAME

     primes -- generate primes

SYNOPSIS

     primes [-d] [start [stop]]

DESCRIPTION

     The primes utility prints primes in ascending order, one per line, starting at or above start and continuing until, but not including stop.
     The start value must be at least 0 and not greater than stop.  The stop value must not be greater than the maximum possible value of unsigned
     integer types on your system (4294967295 for 32-bit systems and 18446744073709551615 for 64-bit systems).	The default value of stop is
     4294967295 on 32-bit and 18446744073709551615 on 64-bit.

     When the primes utility is invoked with no arguments, start is read from standard input.  stop is taken to be 4294967295 on 32-bit and
     18446744073709551615 on 64-bit.  The start value may be preceded by a single '+'.	The start value is terminated by a non-digit character
     (such as a newline).  The input line must not be longer than 255 characters.  When given the -d argument, primes prints the difference
     between the current and the previous prime.

DIAGNOSTICS

     Out of range or invalid input results in an appropriate error message being written to standard error.

BUGS

     primes won't get you a world record.

BSD
								 February 3, 2008							       BSD

factor(1)						      General Commands Manual							 factor(1)

NAME

       factor, primes - factor a number, generate large primes

SYNOPSIS

       [number]

       [start[stop]]

DESCRIPTION

       If  no arguments are provided on the command line, waits for a number to be typed in.  If a positive number is typed, it factors the number
       and print its prime factors; each one is printed the proper number of times.  It then waits for another number.	exits if it  encounters  a
       zero or any non-numeric character.

       If an argument is provided on the command line, factors the number as above, then exits.

       Maximum time to factor is proportional to sqrt(n) and occurs when n is prime or the square of a prime.

       The largest number that can be dealt with by is 1.0e14.

       prints  prime numbers between a lower and upper bound.  If no arguments are provided on the command line, waits for two numbers to be typed
       in.  The first number is interpreted as the lower bound; the second as the upper bound.	All prime numbers in the resulting inclusive range
       are printed.

       If  start  is  specified, all primes greater than or equal to start are printed.  If both start and stop are given, all primes occurring in
       the inclusive range start through stop are printed.

       start and stop values must be integers represented as long integers.

       If the stop value is omitted in either case, runs either until overflow occurs or until it is stopped by typing the interrupt character.

       The largest number that can be dealt with by is	2,147,483,647.

DIAGNOSTICS

       Both commands print when the input is out of range, illegal characters are encountered, or when start is greater than stop.

EXAMPLES

       Print the prime factorization for the number 12:

       Print all prime numbers between 0 and 20:

																	 factor(1)