214 lines
6.5 KiB
C
214 lines
6.5 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 Sebastian Pancratz
|
||
|
|
Copyright (C) 2009 William Hart
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
#include "flint.h"
|
||
|
|
#include "fmpz.h"
|
||
|
|
#include "fmpz_mod_poly.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
main(void)
|
||
|
|
{
|
||
|
|
int i, result;
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
|
||
|
|
flint_printf("divrem_divconquer....");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/* Check q*b + r = a, no aliasing */
|
||
|
|
for (i = 0; i < 5000; i++)
|
||
|
|
{
|
||
|
|
fmpz_t p;
|
||
|
|
fmpz_mod_poly_t a, b, q, r, t;
|
||
|
|
|
||
|
|
fmpz_init(p);
|
||
|
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
|
fmpz_add_ui(p, p, 2);
|
||
|
|
|
||
|
|
fmpz_mod_poly_init(a, p);
|
||
|
|
fmpz_mod_poly_init(b, p);
|
||
|
|
fmpz_mod_poly_init(q, p);
|
||
|
|
fmpz_mod_poly_init(r, p);
|
||
|
|
fmpz_mod_poly_init(t, p);
|
||
|
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 100));
|
||
|
|
fmpz_mod_poly_randtest_not_zero(b, state, n_randint(state, 100) + 1);
|
||
|
|
|
||
|
|
{
|
||
|
|
fmpz_t d;
|
||
|
|
fmpz *leadB = fmpz_mod_poly_lead(b);
|
||
|
|
|
||
|
|
fmpz_init(d);
|
||
|
|
fmpz_gcd(d, p, leadB);
|
||
|
|
while (!fmpz_is_one(d))
|
||
|
|
{
|
||
|
|
fmpz_divexact(leadB, leadB, d);
|
||
|
|
fmpz_gcd(d, p, leadB);
|
||
|
|
}
|
||
|
|
fmpz_clear(d);
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_divrem_divconquer(q, r, a, b);
|
||
|
|
fmpz_mod_poly_mul(t, q, b);
|
||
|
|
fmpz_mod_poly_add(t, t, r);
|
||
|
|
|
||
|
|
result = (fmpz_mod_poly_equal(a, t));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL #1:\n");
|
||
|
|
flint_printf("p = "), fmpz_print(p), flint_printf("\n\n");
|
||
|
|
flint_printf("a = "), fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
|
flint_printf("b = "), fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
|
flint_printf("q = "), fmpz_mod_poly_print(q), flint_printf("\n\n");
|
||
|
|
flint_printf("r = "), fmpz_mod_poly_print(r), flint_printf("\n\n");
|
||
|
|
flint_printf("t = "), fmpz_mod_poly_print(t), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_clear(a);
|
||
|
|
fmpz_mod_poly_clear(b);
|
||
|
|
fmpz_mod_poly_clear(q);
|
||
|
|
fmpz_mod_poly_clear(r);
|
||
|
|
fmpz_mod_poly_clear(t);
|
||
|
|
fmpz_clear(p);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Alias a and q, b and r */
|
||
|
|
for (i = 0; i < 500; i++)
|
||
|
|
{
|
||
|
|
fmpz_t p;
|
||
|
|
fmpz_mod_poly_t a, b, q, r;
|
||
|
|
|
||
|
|
fmpz_init(p);
|
||
|
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
|
fmpz_add_ui(p, p, 2);
|
||
|
|
|
||
|
|
fmpz_mod_poly_init(a, p);
|
||
|
|
fmpz_mod_poly_init(b, p);
|
||
|
|
fmpz_mod_poly_init(q, p);
|
||
|
|
fmpz_mod_poly_init(r, p);
|
||
|
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 100));
|
||
|
|
fmpz_mod_poly_randtest_not_zero(b, state, n_randint(state, 100) + 1);
|
||
|
|
|
||
|
|
{
|
||
|
|
fmpz_t d;
|
||
|
|
fmpz *leadB = fmpz_mod_poly_lead(b);
|
||
|
|
|
||
|
|
fmpz_init(d);
|
||
|
|
fmpz_gcd(d, p, leadB);
|
||
|
|
while (!fmpz_is_one(d))
|
||
|
|
{
|
||
|
|
fmpz_divexact(leadB, leadB, d);
|
||
|
|
fmpz_gcd(d, p, leadB);
|
||
|
|
}
|
||
|
|
fmpz_clear(d);
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_divrem_divconquer(q, r, a, b);
|
||
|
|
fmpz_mod_poly_divrem_divconquer(a, b, a, b);
|
||
|
|
|
||
|
|
result = (fmpz_mod_poly_equal(q, a) && fmpz_mod_poly_equal(r, b));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL #2:\n");
|
||
|
|
flint_printf("p = "), fmpz_print(p), flint_printf("\n\n");
|
||
|
|
flint_printf("a = "), fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
|
flint_printf("b = "), fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
|
flint_printf("q = "), fmpz_mod_poly_print(q), flint_printf("\n\n");
|
||
|
|
flint_printf("r = "), fmpz_mod_poly_print(r), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_clear(a);
|
||
|
|
fmpz_mod_poly_clear(b);
|
||
|
|
fmpz_mod_poly_clear(q);
|
||
|
|
fmpz_mod_poly_clear(r);
|
||
|
|
fmpz_clear(p);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Alias b and q, a and r */
|
||
|
|
for (i = 0; i < 500; i++)
|
||
|
|
{
|
||
|
|
fmpz_t p;
|
||
|
|
fmpz_mod_poly_t a, b, q, r;
|
||
|
|
|
||
|
|
fmpz_init(p);
|
||
|
|
fmpz_randtest_unsigned(p, state, 2 * FLINT_BITS);
|
||
|
|
fmpz_add_ui(p, p, 2);
|
||
|
|
|
||
|
|
fmpz_mod_poly_init(a, p);
|
||
|
|
fmpz_mod_poly_init(b, p);
|
||
|
|
fmpz_mod_poly_init(q, p);
|
||
|
|
fmpz_mod_poly_init(r, p);
|
||
|
|
fmpz_mod_poly_randtest(a, state, n_randint(state, 100));
|
||
|
|
fmpz_mod_poly_randtest_not_zero(b, state, n_randint(state, 100) + 1);
|
||
|
|
|
||
|
|
{
|
||
|
|
fmpz_t d;
|
||
|
|
fmpz *leadB = fmpz_mod_poly_lead(b);
|
||
|
|
|
||
|
|
fmpz_init(d);
|
||
|
|
fmpz_gcd(d, p, leadB);
|
||
|
|
while (!fmpz_is_one(d))
|
||
|
|
{
|
||
|
|
fmpz_divexact(leadB, leadB, d);
|
||
|
|
fmpz_gcd(d, p, leadB);
|
||
|
|
}
|
||
|
|
fmpz_clear(d);
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_divrem_divconquer(q, r, a, b);
|
||
|
|
fmpz_mod_poly_divrem_divconquer(b, a, a, b);
|
||
|
|
|
||
|
|
result = (fmpz_mod_poly_equal(q, b) && fmpz_mod_poly_equal(r, a));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL #3:\n");
|
||
|
|
flint_printf("p = "), fmpz_print(p), flint_printf("\n\n");
|
||
|
|
flint_printf("a = "), fmpz_mod_poly_print(a), flint_printf("\n\n");
|
||
|
|
flint_printf("b = "), fmpz_mod_poly_print(b), flint_printf("\n\n");
|
||
|
|
flint_printf("q = "), fmpz_mod_poly_print(q), flint_printf("\n\n");
|
||
|
|
flint_printf("r = "), fmpz_mod_poly_print(r), flint_printf("\n\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
fmpz_mod_poly_clear(a);
|
||
|
|
fmpz_mod_poly_clear(b);
|
||
|
|
fmpz_mod_poly_clear(q);
|
||
|
|
fmpz_mod_poly_clear(r);
|
||
|
|
fmpz_clear(p);
|
||
|
|
}
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return 0;
|
||
|
|
}
|