Mod(0,1) equals 0 and each integer from 2 and 10^8, but not 1. This is a regression compared to pari-stable which gives Mod(0,1)==1 as 1.
I replicated this bug in versions
[2, 8, 0, 17896, "0848537"]
[2, 8, 0, 17848, "fa553d7"]
with both
amd64 running mingw (x86-64/GMP-6.0.0 kernel) 64-bit version
and
i686 running mingw (ix86 kernel) 32-bit version
In particular
sum(n=1,1e8,Mod(0,1)==n)
gives 99999999 rather than 100000000.
Charles Greathouse
Analyst/Programmer
Case Western Reserve University