3 int test_MI_div (int iterations)
7 // Check against multiplication.
8 for (i = iterations; i > 0; i--) {
9 cl_I m = testrandom_I();
10 cl_modint_ring R = find_modint_ring(m);
11 cl_I ai = testrandom_I();
13 cl_MI a = R->canonhom(ai);
14 cl_MI b = R->canonhom(testrandom_I());
15 ASSERT3(a*R->div(b,a) == b, m,a,b);