[Jprogramming] Implementation of q:

[Devon McCormick]

One interesting thing I saw at the APL Moot - Jane Sullivan showed me
the open-source YAFU - Yet Another Factorization Utility -
http://yafu.sourceforge.net/ .  It had great performance.  I forget
the example she showed me - a 100-digit number? - but " q: " ran for
many hours and did not come up with the factors.

I've thought it would be a good project to learn how to update the J source.

On Wed, Jun 27, 2012 at 3:11 PM, Raul Miller <rauldmiller at gmail.com> wrote:
> Here's what it was in 2007:
>
> http://www.jsoftware.com/pipermail/general/2007-February/028865.html
>
> --
> Raul
>
> On Wed, Jun 27, 2012 at 2:46 PM, David Vaughan <purpleblues13 at gmail.com> wrote:
>> I was wondering what method q: uses to produce prime factorisations.
>>
>> Does anyone know?
>>
>> Thanks.
>> ___________________________
>>
>> David Vaughan
>> ----------------------------------------------------------------------
>> For information about J forums see http://www.jsoftware.com/forums.htm
> ----------------------------------------------------------------------
> For information about J forums see http://www.jsoftware.com/forums.htm



-- 
Devon McCormick, CFA
^me^ at acm.
org is my
preferred e-mail