Re: [Bug-apl] Problem with modulo arithmetic on Gaussian integers

[Frederick Pitts]

Jürgen,

        SVN 937 works for me.

        Out of curiosity, is the Euclidean division algorithm described
starting at the bottom of page 6 of http://www.math.uconn.edu/~kconrad/
blurbs/ugradnumthy/Zinotes.pdf relevant to how you are performing the
modulo function on Gaussian integers?  The description is fairly
specific about how to select the Gaussian integer for the quotient.

Regards,

Fred

On Wed, 2017-04-26 at 22:08 +0200, Juergen Sauermann wrote:
> Hi,
> 
> thanks a lot. I believe I found it now.
> 
> The check for near-int in the complex modulo was still incorrect
> (and interestingy correct in the non-complex case).  SVN 937.
> 
> /// Jürgen
> 
> 
> On 04/26/2017 09:08 PM, Peter Teeson wrote:
> > In which header is cval() defined? 
> > 
> > 
> > > On Apr 26, 2017, at 3:00 PM, Kacper Gutowski <address@hidden>
> > > wrote:
> > > 
> > > On Wed, Apr 26, 2017 at 06:30:34PM +0200, Juergen Sauermann
> > > wrote:
> > > > For those of you that can reproduce the problem on their
> > > > machine, please let me
> > > > know if the problem has not disappeared.
> > > 
> > > I just compiled 934 and 3J1|23J1 gives 3J1 for me too.
> > > My g++ version is 6.3.0 20170415 on debian sid.
> > > 
> > > -k
> > > 
>