In my publicated paper ( JoJ Vol.4 No_2 2015 )
the unicodes are not limp in pdf (thank You very much)!
2017-05-11 18:42 GMT+02:00 'Mike Day' via Programming <
programm...@jsoftware.com>:
> My verb is pedestrian, not J806 itself!
> M
>
> Please reply to mike_liz@tiscali.co.uk.
> Sent from my
My verb is pedestrian, not J806 itself!
M
Please reply to mike_liz@tiscali.co.uk.
Sent from my iPad
> On 11 May 2017, at 17:36, Istvan Kadar wrote:
>
> I have Windows 7 and J602. It is not limp in PDF or DOC. Thanks!
>
> 2017-05-11 18:10 GMT+02:00 'Mike Day' via Programming <
> prog
I have Windows 7 and J602. It is not limp in PDF or DOC. Thanks!
2017-05-11 18:10 GMT+02:00 'Mike Day' via Programming <
programm...@jsoftware.com>:
> I've now got my p159 verb to work again. I'd written it back in J4 or J5
> days, and some chars had got mashed! Anyway, although it doesn't br
I've now got my p159 verb to work again. I'd written it back in J4 or J5 days,
and some chars had got mashed! Anyway, although it doesn't break the sound
barrier, it does limp home with the correct answer in under a minute for the
given problem size, running in J806 under Windows 10.
Mike
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.
