I appear to have solved PE 159, & have even found the verb that seemed to do
the work, but have forgotten how it works!
Anyway, it might be worth considering a constructive approach, whereby you
consider possible combinations of primes generating all numbers in the domain
rather than anal
http://code.jsoftware.com/wiki/Essays/Factorings
On Wed, May 10, 2017 at 7:12 AM, David Lambert wrote:
> I need a fast algorithm to find all factorizations of a number. This
> method is terribly redundant, let's say the prime factors are 2^19 . And
> the method is get the nub of the product o
I need a fast algorithm to find all factorizations of a number. This
method is terribly redundant, let's say the prime factors are 2^19 .
And the method is get the nub of the product of all complete partitions
of all the permutations of the prime factors.
boxdraw_j_ 1
permutations=: A.
Hi Bill,
Just to add that I get the same behaviour you describe on win-xp with jqt
and jconsole on Windows 7.
On Wed, May 10, 2017 at 7:02 PM, bill lam wrote:
> I can duplicate the behavior on win-xp. reading jpg was ok on jqt but
> failed on jconsole.
>
> I think the issue is loading jqt.dll u
I can duplicate the behavior on win-xp. reading jpg was ok on jqt but
failed on jconsole.
I think the issue is loading jqt.dll under windows jconsole cannot
loading files in imageformats.
png does not have such problem since png support is always built-in
inside qt core dlls and does not need add
