Re: [Jprogramming] multiplication bug

2015-07-31 Thread chris burke
Date: Fri, 31 Jul 2015 12:34:28 -0400 > > Subject: [Jprogramming] multiplication bug > > > > I tried it in > > > >9!:14 '' > > j803/2014-10-19-11:11:11 > > > > What is the latest and greatest these days? > > Also, is your result same for

Re: [Jprogramming] multiplication bug

2015-07-31 Thread Jon Hough
I'm still on J803, but J804 has been released. > From: ns...@hotmail.com > To: programm...@jsoftware.com > Date: Fri, 31 Jul 2015 12:34:28 -0400 > Subject: [Jprogramming] multiplication bug > > I tried it in > >9!:14 '' > j803/2014-10-19-11:11:11

[Jprogramming] multiplication bug

2015-07-31 Thread Andrew Nikitin
I tried it in    9!:14 '' j803/2014-10-19-11:11:11 What is the latest and greatest these days? Also, is your result same for |. > Jon Hough jghough at outlook.com  > Fri Jul 31 16:24:33 UTC 2015 > Hmm... I tried it and I got  >   P&|@*/ mul  >  > 346052331

Re: [Jprogramming] multiplication bug

2015-07-31 Thread Raul Miller
.com >> To: programm...@jsoftware.com >> Date: Fri, 31 Jul 2015 12:16:20 -0400 >> Subject: [Jprogramming] multiplication bug >> >> i am trying to multiply several integers modulo small prime number here and >> fail at that. >> >> ---

Re: [Jprogramming] multiplication bug

2015-07-31 Thread 'Pascal Jasmin' via Programming
loat. This fixes it on 32 bit. P=:9x+1e9 mul=.1+pr (P&|@^) 2x (P&|@*) pw P&|@*/ |. mul 39355325 P&|@*/ mul 39355325 From: Andrew Nikitin To: J programming Sent: Friday, July 31, 2015 12:16 PM Subject: [Jprogramming] multiplication

Re: [Jprogramming] multiplication bug

2015-07-31 Thread Jon Hough
Hmm... I tried it and I got P&|@*/ mul 346052331 > From: ns...@hotmail.com > To: programm...@jsoftware.com > Date: Fri, 31 Jul 2015 12:16:20 -0400 > Subject: [Jprogramming] multiplication bug > > i am trying to multiply several integers modulo small prime number he

[Jprogramming] multiplication bug

2015-07-31 Thread Andrew Nikitin
i am trying to multiply several integers modulo small prime number here and fail at that.      NB. highest power of prime x that divides !y    pffact=:([: +/ ] <.@% [ ^ 1 + [: i. <.@^.)    P=:9+1e9    pw=.1e9 pffact">~ pr=.p:i.240 NB. first few primes and their powers