107 lines
3.0 KiB
C
107 lines
3.0 KiB
C
|
/*=============================================================================
|
||
|
|
|
||
|
|
This file is part of FLINT.
|
||
|
|
|
||
|
|
FLINT is free software; you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU General Public License as published by
|
||
|
|
the Free Software Foundation; either version 2 of the License, or
|
||
|
|
(at your option) any later version.
|
||
|
|
|
||
|
|
FLINT is distributed in the hope that it will be useful,
|
||
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
GNU General Public License for more details.
|
||
|
|
|
||
|
|
You should have received a copy of the GNU General Public License
|
||
|
|
along with FLINT; if not, write to the Free Software
|
||
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||
|
|
|
||
|
|
=============================================================================*/
|
||
|
|
/******************************************************************************
|
||
|
|
|
||
|
|
Copyright (C) 2011 Fredrik Johansson
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
#include "flint.h"
|
||
|
|
#include "nmod_vec.h"
|
||
|
|
#include "nmod_poly.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
main(void)
|
||
|
|
{
|
||
|
|
int iter;
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
|
||
|
|
|
||
|
|
flint_printf("is_squarefree....");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
for (iter = 0; iter < 200 * flint_test_multiplier(); iter++)
|
||
|
|
{
|
||
|
|
nmod_poly_t poly, Q, R, t;
|
||
|
|
mp_limb_t modulus;
|
||
|
|
slong i, num_factors, exp, max_exp;
|
||
|
|
int v, result;
|
||
|
|
|
||
|
|
modulus = n_randtest_prime(state, 0);
|
||
|
|
|
||
|
|
nmod_poly_init(poly, modulus);
|
||
|
|
nmod_poly_init(t, modulus);
|
||
|
|
nmod_poly_init(Q, modulus);
|
||
|
|
nmod_poly_init(R, modulus);
|
||
|
|
|
||
|
|
nmod_poly_set_coeff_ui(poly, 0, n_randint(state, modulus));
|
||
|
|
num_factors = n_randint(state, 5);
|
||
|
|
|
||
|
|
max_exp = 0;
|
||
|
|
for (i = 0; i < num_factors; i++)
|
||
|
|
{
|
||
|
|
do {
|
||
|
|
nmod_poly_randtest(t, state, n_randint(state, 10));
|
||
|
|
} while (!nmod_poly_is_irreducible(t) ||
|
||
|
|
(nmod_poly_length(t) < 2));
|
||
|
|
|
||
|
|
exp = n_randint(state, 4) + 1;
|
||
|
|
if (n_randint(state, 2) == 0)
|
||
|
|
exp = 1;
|
||
|
|
|
||
|
|
nmod_poly_divrem(Q, R, poly, t);
|
||
|
|
if (!nmod_poly_is_zero(R))
|
||
|
|
{
|
||
|
|
nmod_poly_pow(t, t, exp);
|
||
|
|
nmod_poly_mul(poly, poly, t);
|
||
|
|
max_exp = FLINT_MAX(exp, max_exp);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
v = nmod_poly_is_squarefree(poly);
|
||
|
|
|
||
|
|
if (v == 1)
|
||
|
|
result = (max_exp <= 1 && !nmod_poly_is_zero(poly));
|
||
|
|
else
|
||
|
|
result = (max_exp > 1 || nmod_poly_is_zero(poly));
|
||
|
|
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL: %wu, %wd, %d\n", modulus, max_exp, v);
|
||
|
|
nmod_poly_print(poly); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
nmod_poly_clear(poly);
|
||
|
|
nmod_poly_clear(t);
|
||
|
|
nmod_poly_clear(Q);
|
||
|
|
nmod_poly_clear(R);
|
||
|
|
}
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return 0;
|
||
|
|
}
|