|
|
1.1 root 1: .pa 1
2: .he 'FACTOR (I)'1/15/73'FACTOR (I)'
3: .ti 0
4: NAME factor -- discover prime factors of a number
5: .sp
6: .ti 0
7: SYNOPSIS factor______
8: .sp
9: .ti 0
10: DESCRIPTION When factor is invoked, it types
11: out "Enter:" at you. If you type in a positive
12: number less than 2^56 (about 7.2E16), it will repeat the number
13: back at you and then its prime factors each one printed
14: the proper number of times. Then it says "Enter:" again.
15: To exit, feed it an EOT or a delete.
16: .sp
17: Maximum time to factor is proportional to sqrt(n) and occurs
18: when n is prime. It takes 1 minute to factor a prime near 10^13.
19: .sp
20: .ti 0
21: FILES --
22: .sp
23: .ti 0
24: SEE ALSO --
25: .sp
26: .ti 0
27: DIAGNOSTICS "Ouch." for input out of range or for garbage input.
28: .sp
29: .ti 0
30: BUGS --
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.