133 lines
3.9 KiB
C
133 lines
3.9 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 William Hart
|
|
Copyright (C) 2011 Sebastian Pancratz
|
|
|
|
******************************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <gmp.h>
|
|
#include "flint.h"
|
|
#include "fmpz.h"
|
|
#include "fmpz_poly.h"
|
|
#include "nmod_poly.h"
|
|
#include "ulong_extras.h"
|
|
|
|
int
|
|
main(void)
|
|
{
|
|
int i, result;
|
|
FLINT_TEST_INIT(state);
|
|
|
|
flint_printf("hensel_lift_once....");
|
|
fflush(stdout);
|
|
|
|
/* We check that lifting local factors of F yields factors */
|
|
for (i = 0; i < 100 * flint_test_multiplier(); i++)
|
|
{
|
|
fmpz_poly_t F, G, H, R;
|
|
fmpz_poly_factor_t F_fac;
|
|
nmod_poly_factor_t f_fac;
|
|
slong bits, nbits, n, exp, j;
|
|
|
|
bits = n_randint(state, 200) + 1;
|
|
nbits = n_randint(state, FLINT_BITS - 6) + 6;
|
|
|
|
fmpz_poly_init(F);
|
|
fmpz_poly_init(G);
|
|
fmpz_poly_init(H);
|
|
fmpz_poly_init(R);
|
|
nmod_poly_factor_init(f_fac);
|
|
fmpz_poly_factor_init(F_fac);
|
|
|
|
n = n_randprime(state, nbits, 0);
|
|
exp = bits / (FLINT_BIT_COUNT(n) - 1) + 1;
|
|
|
|
/* Produce F as the product of random G and H */
|
|
{
|
|
nmod_poly_t f;
|
|
|
|
nmod_poly_init(f, n);
|
|
|
|
do {
|
|
do {
|
|
fmpz_poly_randtest(G, state, n_randint(state, 200) + 2, bits);
|
|
} while (G->length < 2);
|
|
|
|
fmpz_randtest_not_zero(G->coeffs, state, bits);
|
|
fmpz_one(fmpz_poly_lead(G));
|
|
|
|
do {
|
|
fmpz_poly_randtest(H, state, n_randint(state, 200) + 2, bits);
|
|
} while (H->length < 2);
|
|
|
|
fmpz_randtest_not_zero(H->coeffs, state, bits);
|
|
fmpz_one(fmpz_poly_lead(H));
|
|
|
|
fmpz_poly_mul(F, G, H);
|
|
|
|
fmpz_poly_get_nmod_poly(f, F);
|
|
} while (!nmod_poly_is_squarefree(f));
|
|
|
|
fmpz_poly_get_nmod_poly(f, G);
|
|
nmod_poly_factor_insert(f_fac, f, 1);
|
|
fmpz_poly_get_nmod_poly(f, H);
|
|
nmod_poly_factor_insert(f_fac, f, 1);
|
|
nmod_poly_clear(f);
|
|
}
|
|
|
|
fmpz_poly_hensel_lift_once(F_fac, F, f_fac, exp);
|
|
|
|
result = 1;
|
|
for (j = 0; j < F_fac->num; j++)
|
|
{
|
|
fmpz_poly_rem(R, F, F_fac->p + j);
|
|
result &= (R->length == 0);
|
|
}
|
|
|
|
if (!result)
|
|
{
|
|
flint_printf("FAIL:\n");
|
|
flint_printf("bits = %wd, n = %wd, exp = %wd\n", bits, n, exp);
|
|
fmpz_poly_print(F); flint_printf("\n\n");
|
|
fmpz_poly_print(G); flint_printf("\n\n");
|
|
fmpz_poly_print(H); flint_printf("\n\n");
|
|
fmpz_poly_factor_print(F_fac); flint_printf("\n\n");
|
|
abort();
|
|
}
|
|
|
|
nmod_poly_factor_clear(f_fac);
|
|
fmpz_poly_factor_clear(F_fac);
|
|
fmpz_poly_clear(F);
|
|
fmpz_poly_clear(G);
|
|
fmpz_poly_clear(H);
|
|
fmpz_poly_clear(R);
|
|
}
|
|
|
|
FLINT_TEST_CLEANUP(state);
|
|
|
|
flint_printf("PASS\n");
|
|
return 0;
|
|
}
|
|
|