133{
136 R.init(a);
137 int counts[49];
138 for (int i = 0; i < 49; i++) counts[i] = 0;
139 for (int i = 0; i < 49 * 200; i++)
140 {
141 R.random(a);
142 EXPECT_TRUE(a >= 0);
143 EXPECT_TRUE(a < 49);
144 counts[a]++;
145 }
146#if 0
148 for (int i=0; i<49; i++)
149 {
150 std::cout << i << " " << counts[i] << std::endl;
151 sum += (counts[i]-200)^2;
152 }
153
155 std::cout <<
"chi = " <<
sum << std::endl;
156 for (int i=0; i<49; i++)
157 {
158 a = i;
161 std::cout << std::endl;
162 }
163#endif
165}
fq_zech_struct ElementType
aring-style adapter for FLINT's Zech-logarithm representation of small finite fields GF(p^n).
MPREAL_MSVC_DEBUGVIEW_DATA void clear(::mpfr_ptr)
void dintarray(M2_arrayint a)
const mpreal sum(const mpreal tab[], const unsigned long int n, int &status, mp_rnd_t mode=mpreal::get_default_rnd())