Short:        Prime factor computing
Type:         misc/math
Architecture: m68k-amigaos

   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