
|
84799 packages online
|
|
 |
|
|
|
No screenshot available
|
|
Usage: pfactor n1 [n2 [n3 [...] ] ]
Prints prime factorisations of given numbers n1, n2 etc.
Works from CLI only, and is limited to integers of size <= 2^32-1,
ie. for n <= 4294967295 (which is actually prime).
Factorisations are done almost instantaneously.
Source available free on request.
- Martin Scott (email: mws@castle.ed.ac.uk)
============================= Archive contents =============================
Original Packed Ratio Date Time Name
-------- ------- ----- --------- -------- -------------
21736 18280 15.8% 25-Feb-92 17:19:56 pfactor
352 256 27.2% 25-Feb-92 17:20:06 pfactor.readme
-------- ------- ----- --------- --------
22088 18536 16.0% 07-Mar-92 20:26:40 2 files
|
Contents of misc/math/pfactor.lha
PERMSSN UID GID PACKED SIZE RATIO CRC STAMP NAME
---------- ----------- ------- ------- ------ ---------- ------------ -------------
[generic] 18280 21736 84.1% -lh5- af40 Feb 25 1992 pfactor
[generic] 256 352 72.7% -lh5- a814 Feb 25 1992 pfactor.readme
---------- ----------- ------- ------- ------ ---------- ------------ -------------
Total 2 files 18536 22088 83.9% Mar 7 1992
|
|
|
 |
Page generated in 0.02 seconds |
Aminet © 1992-2024 Urban
Müller and the Aminet team.
Aminet contact address: <aminet aminet net> |