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

[Juergen Sauermann]

Hi Fred,

actually it does on my machine:

                    ______ _   __ __  __    ___     ____   __
                   / ____// | / // / / /   /   |   / __ \ / /
                  / / __ /  |/ // / / /   / /| |  / /_/ // / 
                 / /_/ // /|  // /_/ /   / ___ | / ____// /___
                 \____//_/ |_/ \____/   /_/  |_|/_/    /_____/
                                      
                 Welcome to GNU APL version 1.7 / 12784:12785M
                                      
                Copyright (C) 2008-2016  Dr. Jürgen Sauermann
                       Banner by FIGlet: www.figlet.org
                                      
                This program comes with ABSOLUTELY NO WARRANTY;
                          for details run: apl --gpl.
                                      
     This program is free software, and you are welcome to redistribute it
         according to the GNU Public License (GPL) version 3 or later.
                                      
      23J1 25J25 ÷ 3J1
7J¯2 10J5

      3J1 | 23J1 25J25
0 0


However, if I remember correctly then some of the changes that I made lately were in
header files (ComplexCell.hh and FloatCell.hh). If you did ./configure without options, then
your build is probably is a 'fast' one, which may not have detected header file changes.

Please try make clean at the top level and rebuild GNU APL to see if the problem persists.

Best Regards,
Jürgen Sauermann

On 04/25/2017 09:30 PM, Frederick Pitts wrote:

Jeurgen,

   A greatest common divisor of 23J1 and 25J25 is 3J1.
Complex division by of 23J1 and 25J25 by 3J1 yields Gaussian integers

      23J1 25J25 ÷ 3J1
7J¯2 10J5

but mod 3J1 of the same numbers does not consistently yield zeroes

      3J1 | 23J1 25J25
3J1 0

I can provide numerous other examples of this problem if needed.

Regards,

Fred