[CLN-list] modular polynomials
Jens Vollinga
jensv at nikhef.nl
Fri Sep 26 19:44:09 CEST 2008
Hi,
my problems with cl_UP_MI seem to boil down to what happens in the
following code fragment:
cl_modint_ring R = find_modint_ring(11);
cl_univpoly_modint_ring UPR = find_univpoly_ring(R);
umod a = UPR->create(0);
a.set_coeff(0, cl_MI(R, 1));
a.finalize();
cout << "a " << a << endl;
// gives: a (1 mod 11)
umod c = a;
c.set_coeff(0, cl_MI(R, 10));
c.finalize();
cout << "c " << c << endl;
// gives: c (10 mod 11)
cout << "a " << a << endl;
// gives: a (10 mod 11)
So, my question to the developers is now: WTF?!?!
Regards,
Jens
More information about the CLN-list
mailing list