309 lines
9.3 KiB
C
309 lines
9.3 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) 2009 William Hart
|
||
|
|
Copyright (C) 2010 Sebastian Pancratz
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
#include "flint.h"
|
||
|
|
#include "fmpz.h"
|
||
|
|
#include "fmpz_poly.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
main(void)
|
||
|
|
{
|
||
|
|
int i, result;
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
|
||
|
|
flint_printf("xgcd_modular....");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/* Check s*f + t*g == r */
|
||
|
|
for (i = 0; i < 50 * flint_test_multiplier(); i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_t d, f, g, s, t;
|
||
|
|
fmpz_t r;
|
||
|
|
|
||
|
|
fmpz_poly_init(d);
|
||
|
|
fmpz_poly_init(f);
|
||
|
|
fmpz_poly_init(g);
|
||
|
|
fmpz_poly_init(s);
|
||
|
|
fmpz_poly_init(t);
|
||
|
|
fmpz_init(r);
|
||
|
|
|
||
|
|
do {
|
||
|
|
fmpz_poly_randtest(f, state, n_randint(state, 50), 150);
|
||
|
|
fmpz_poly_randtest(g, state, n_randint(state, 50), 150);
|
||
|
|
fmpz_poly_primitive_part(f, f);
|
||
|
|
fmpz_poly_primitive_part(g, g);
|
||
|
|
fmpz_poly_gcd_modular(d, f, g);
|
||
|
|
} while (d->length != 1);
|
||
|
|
|
||
|
|
fmpz_poly_xgcd_modular(r, s, t, f, g);
|
||
|
|
fmpz_poly_mul(s, s, f);
|
||
|
|
fmpz_poly_mul(t, t, g);
|
||
|
|
fmpz_poly_add(s, s, t);
|
||
|
|
|
||
|
|
result = fmpz_poly_equal_fmpz(s, r);
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL (check s*f + t*g == r):\n");
|
||
|
|
flint_printf("f = "), fmpz_poly_print(f), flint_printf("\n");
|
||
|
|
flint_printf("g = "), fmpz_poly_print(g), flint_printf("\n");
|
||
|
|
flint_printf("s = "), fmpz_poly_print(s); flint_printf("\n");
|
||
|
|
flint_printf("t = "), fmpz_poly_print(t); flint_printf("\n");
|
||
|
|
flint_printf("d = "), fmpz_poly_print(d); flint_printf("\n");
|
||
|
|
flint_printf("r = "), fmpz_print(r); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(r);
|
||
|
|
fmpz_poly_clear(d);
|
||
|
|
fmpz_poly_clear(f);
|
||
|
|
fmpz_poly_clear(g);
|
||
|
|
fmpz_poly_clear(s);
|
||
|
|
fmpz_poly_clear(t);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check s*f + t*g == r with smaller polynomials */
|
||
|
|
for (i = 0; i < 50 * flint_test_multiplier(); i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_t d, f, g, s, t;
|
||
|
|
fmpz_t r;
|
||
|
|
|
||
|
|
fmpz_poly_init(d);
|
||
|
|
fmpz_poly_init(f);
|
||
|
|
fmpz_poly_init(g);
|
||
|
|
fmpz_poly_init(s);
|
||
|
|
fmpz_poly_init(t);
|
||
|
|
fmpz_init(r);
|
||
|
|
|
||
|
|
do {
|
||
|
|
fmpz_poly_randtest(f, state, n_randint(state, 30), 50);
|
||
|
|
fmpz_poly_randtest(g, state, n_randint(state, 30), 50);
|
||
|
|
fmpz_poly_primitive_part(f, f);
|
||
|
|
fmpz_poly_primitive_part(g, g);
|
||
|
|
fmpz_poly_gcd_modular(d, f, g);
|
||
|
|
} while (d->length != 1);
|
||
|
|
|
||
|
|
fmpz_poly_xgcd_modular(r, s, t, f, g);
|
||
|
|
fmpz_poly_mul(s, s, f);
|
||
|
|
fmpz_poly_mul(t, t, g);
|
||
|
|
fmpz_poly_add(s, s, t);
|
||
|
|
|
||
|
|
result = fmpz_poly_equal_fmpz(s, r);
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL (check small s*f + t*g == r):\n");
|
||
|
|
flint_printf("f = "), fmpz_poly_print(f), flint_printf("\n");
|
||
|
|
flint_printf("g = "), fmpz_poly_print(g), flint_printf("\n");
|
||
|
|
flint_printf("s = "), fmpz_poly_print(s); flint_printf("\n");
|
||
|
|
flint_printf("t = "), fmpz_poly_print(t); flint_printf("\n");
|
||
|
|
flint_printf("d = "), fmpz_poly_print(d); flint_printf("\n");
|
||
|
|
flint_printf("r = "), fmpz_print(r); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(r);
|
||
|
|
fmpz_poly_clear(d);
|
||
|
|
fmpz_poly_clear(f);
|
||
|
|
fmpz_poly_clear(g);
|
||
|
|
fmpz_poly_clear(s);
|
||
|
|
fmpz_poly_clear(t);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check aliasing of s and f */
|
||
|
|
for (i = 0; i < 20 * flint_test_multiplier(); i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_t d, f, g, s, t;
|
||
|
|
fmpz_t r;
|
||
|
|
|
||
|
|
fmpz_poly_init(d);
|
||
|
|
fmpz_poly_init(f);
|
||
|
|
fmpz_poly_init(g);
|
||
|
|
fmpz_poly_init(s);
|
||
|
|
fmpz_poly_init(t);
|
||
|
|
fmpz_init(r);
|
||
|
|
|
||
|
|
do {
|
||
|
|
fmpz_poly_randtest(f, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_randtest(g, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_primitive_part(f, f);
|
||
|
|
fmpz_poly_primitive_part(g, g);
|
||
|
|
fmpz_poly_gcd_modular(d, f, g);
|
||
|
|
} while (d->length != 1);
|
||
|
|
|
||
|
|
fmpz_poly_xgcd_modular(r, s, t, f, g);
|
||
|
|
fmpz_poly_xgcd_modular(r, f, t, f, g);
|
||
|
|
|
||
|
|
result = (fmpz_poly_equal(s, f) || fmpz_is_zero(r));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL (alias s and f):\n");
|
||
|
|
flint_printf("f = "), fmpz_poly_print(f), flint_printf("\n");
|
||
|
|
flint_printf("s = "), fmpz_poly_print(s); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(r);
|
||
|
|
fmpz_poly_clear(d);
|
||
|
|
fmpz_poly_clear(f);
|
||
|
|
fmpz_poly_clear(g);
|
||
|
|
fmpz_poly_clear(s);
|
||
|
|
fmpz_poly_clear(t);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check aliasing of s and g */
|
||
|
|
for (i = 0; i < 20 * flint_test_multiplier(); i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_t d, f, g, s, t;
|
||
|
|
fmpz_t r;
|
||
|
|
|
||
|
|
fmpz_poly_init(d);
|
||
|
|
fmpz_poly_init(f);
|
||
|
|
fmpz_poly_init(g);
|
||
|
|
fmpz_poly_init(s);
|
||
|
|
fmpz_poly_init(t);
|
||
|
|
fmpz_init(r);
|
||
|
|
|
||
|
|
do {
|
||
|
|
fmpz_poly_randtest(f, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_randtest(g, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_primitive_part(f, f);
|
||
|
|
fmpz_poly_primitive_part(g, g);
|
||
|
|
fmpz_poly_gcd_modular(d, f, g);
|
||
|
|
} while (d->length != 1);
|
||
|
|
|
||
|
|
fmpz_poly_xgcd_modular(r, s, t, f, g);
|
||
|
|
fmpz_poly_xgcd_modular(r, g, t, f, g);
|
||
|
|
|
||
|
|
result = (fmpz_poly_equal(s, g) || fmpz_is_zero(r));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL (alias s and g):\n");
|
||
|
|
flint_printf("g = "), fmpz_poly_print(g), flint_printf("\n");
|
||
|
|
flint_printf("s = "), fmpz_poly_print(s); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(r);
|
||
|
|
fmpz_poly_clear(d);
|
||
|
|
fmpz_poly_clear(f);
|
||
|
|
fmpz_poly_clear(g);
|
||
|
|
fmpz_poly_clear(s);
|
||
|
|
fmpz_poly_clear(t);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check aliasing of t and f */
|
||
|
|
for (i = 0; i < 20 * flint_test_multiplier(); i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_t d, f, g, s, t;
|
||
|
|
fmpz_t r;
|
||
|
|
|
||
|
|
fmpz_poly_init(d);
|
||
|
|
fmpz_poly_init(f);
|
||
|
|
fmpz_poly_init(g);
|
||
|
|
fmpz_poly_init(s);
|
||
|
|
fmpz_poly_init(t);
|
||
|
|
fmpz_init(r);
|
||
|
|
|
||
|
|
do {
|
||
|
|
fmpz_poly_randtest(f, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_randtest(g, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_primitive_part(f, f);
|
||
|
|
fmpz_poly_primitive_part(g, g);
|
||
|
|
fmpz_poly_gcd_modular(d, f, g);
|
||
|
|
} while (d->length != 1);
|
||
|
|
|
||
|
|
fmpz_poly_xgcd_modular(r, s, t, f, g);
|
||
|
|
fmpz_poly_xgcd_modular(r, s, f, f, g);
|
||
|
|
|
||
|
|
result = (fmpz_poly_equal(t, f) || fmpz_is_zero(r));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL (alias t and f):\n");
|
||
|
|
flint_printf("f = "), fmpz_poly_print(f), flint_printf("\n");
|
||
|
|
flint_printf("t = "), fmpz_poly_print(t); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(r);
|
||
|
|
fmpz_poly_clear(d);
|
||
|
|
fmpz_poly_clear(f);
|
||
|
|
fmpz_poly_clear(g);
|
||
|
|
fmpz_poly_clear(s);
|
||
|
|
fmpz_poly_clear(t);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Check aliasing of t and g */
|
||
|
|
for (i = 0; i < 20 * flint_test_multiplier(); i++)
|
||
|
|
{
|
||
|
|
fmpz_poly_t d, f, g, s, t;
|
||
|
|
fmpz_t r;
|
||
|
|
|
||
|
|
fmpz_poly_init(d);
|
||
|
|
fmpz_poly_init(f);
|
||
|
|
fmpz_poly_init(g);
|
||
|
|
fmpz_poly_init(s);
|
||
|
|
fmpz_poly_init(t);
|
||
|
|
fmpz_init(r);
|
||
|
|
|
||
|
|
do {
|
||
|
|
fmpz_poly_randtest(f, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_randtest(g, state, n_randint(state, 50), 100);
|
||
|
|
fmpz_poly_primitive_part(f, f);
|
||
|
|
fmpz_poly_primitive_part(g, g);
|
||
|
|
fmpz_poly_gcd_modular(d, f, g);
|
||
|
|
} while (d->length != 1);
|
||
|
|
|
||
|
|
fmpz_poly_xgcd_modular(r, s, t, f, g);
|
||
|
|
fmpz_poly_xgcd_modular(r, s, g, f, g);
|
||
|
|
|
||
|
|
result = (fmpz_poly_equal(t, g) || fmpz_is_zero(r));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL (alias t and g):\n");
|
||
|
|
flint_printf("f = "), fmpz_poly_print(g), flint_printf("\n");
|
||
|
|
flint_printf("t = "), fmpz_poly_print(t); flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_clear(r);
|
||
|
|
fmpz_poly_clear(d);
|
||
|
|
fmpz_poly_clear(f);
|
||
|
|
fmpz_poly_clear(g);
|
||
|
|
fmpz_poly_clear(s);
|
||
|
|
fmpz_poly_clear(t);
|
||
|
|
}
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return 0;
|
||
|
|
}
|