/* Copyright (C) 2018 Daniel Schultz This file is part of FLINT. FLINT is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License (LGPL) as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. See . */ #include "nmod_mpoly.h" void gcd_check( nmod_mpoly_t g, nmod_mpoly_t a, nmod_mpoly_t b, nmod_mpoly_t t, nmod_mpoly_ctx_t ctx, slong i, slong j, const char * name) { nmod_mpoly_t ca, cb, cg; nmod_mpoly_init(ca, ctx); nmod_mpoly_init(cb, ctx); nmod_mpoly_init(cg, ctx); if (!nmod_mpoly_gcd_zippel2(g, a, b, ctx)) { flint_printf("FAIL: check gcd can be computed\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } nmod_mpoly_assert_canonical(g, ctx); if (nmod_mpoly_is_zero(g, ctx)) { if (!nmod_mpoly_is_zero(a, ctx) || !nmod_mpoly_is_zero(b, ctx)) { flint_printf("FAIL: check zero gcd\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } goto cleanup; } if (g->coeffs[0] != UWORD(1)) { flint_printf("FAIL: check gcd is monic\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } if (!nmod_mpoly_is_zero(t, ctx) && !nmod_mpoly_divides(cg, g, t, ctx)) { flint_printf("FAIL: check gcd divisor\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } if (!nmod_mpoly_divides(ca, a, g, ctx) || !nmod_mpoly_divides(cb, b, g, ctx)) { flint_printf("FAIL: check divisibility\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } if (!nmod_mpoly_gcd_zippel2(cg, ca, cb, ctx)) { flint_printf("FAIL: check cofactor gcd can be computed\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } nmod_mpoly_assert_canonical(cg, ctx); if (!nmod_mpoly_is_one(cg, ctx)) { flint_printf("FAIL: check gcd of cofactors is one\n"); flint_printf("i = %wd, j = %wd, %s\n", i, j, name); flint_abort(); } cleanup: nmod_mpoly_clear(ca, ctx); nmod_mpoly_clear(cb, ctx); nmod_mpoly_clear(cg, ctx); } int main(void) { slong i, j; FLINT_TEST_INIT(state); flint_printf("gcd_zippel2...."); fflush(stdout); for (i = 0; i < 20 * flint_test_multiplier(); i++) { nmod_mpoly_ctx_t ctx; nmod_mpoly_t a, b, g, ca, cb, cg, t; slong len, len1, len2; ulong degbound; ulong * degbounds, * degbounds1, * degbounds2; mp_limb_t modulus; modulus = n_randint(state, (i % 10 == 0) ? 4: FLINT_BITS - 1) + 1; modulus = n_randbits(state, modulus); modulus = n_nextprime(modulus, 1); nmod_mpoly_ctx_init_rand(ctx, state, 10, modulus); nmod_mpoly_init(g, ctx); nmod_mpoly_init(a, ctx); nmod_mpoly_init(b, ctx); nmod_mpoly_init(ca, ctx); nmod_mpoly_init(cb, ctx); nmod_mpoly_init(cg, ctx); nmod_mpoly_init(t, ctx); len = n_randint(state, 16) + 1; len1 = n_randint(state, 16); len2 = n_randint(state, 16); degbound = 120/(2*ctx->minfo->nvars - 1); degbounds = (ulong * ) flint_malloc(ctx->minfo->nvars*sizeof(ulong)); degbounds1 = (ulong * ) flint_malloc(ctx->minfo->nvars*sizeof(ulong)); degbounds2 = (ulong * ) flint_malloc(ctx->minfo->nvars*sizeof(ulong)); for (j = 0; j < ctx->minfo->nvars; j++) { degbounds[j] = n_randint(state, degbound + UWORD(1)) + UWORD(1); degbounds1[j] = n_randint(state, degbound + UWORD(1)) + UWORD(1); degbounds2[j] = n_randint(state, degbound + UWORD(1)) + UWORD(1); } for (j = 0; j < 5; j++) { nmod_mpoly_randtest_bounds(t, state, len, degbounds, ctx); if (nmod_mpoly_is_zero(t, ctx)) nmod_mpoly_one(t, ctx); nmod_mpoly_randtest_bounds(a, state, len1, degbounds1, ctx); nmod_mpoly_randtest_bounds(b, state, len2, degbounds2, ctx); nmod_mpoly_mul(a, a, t, ctx); nmod_mpoly_mul(b, b, t, ctx); nmod_mpoly_randtest_bits(g, state, len, FLINT_BITS, ctx); gcd_check(g, a, b, t, ctx, i, j, "random"); } flint_free(degbounds); flint_free(degbounds1); flint_free(degbounds2); nmod_mpoly_clear(g, ctx); nmod_mpoly_clear(a, ctx); nmod_mpoly_clear(b, ctx); nmod_mpoly_clear(ca, ctx); nmod_mpoly_clear(cb, ctx); nmod_mpoly_clear(cg, ctx); nmod_mpoly_clear(t, ctx); nmod_mpoly_ctx_clear(ctx); } flint_printf("PASS\n"); FLINT_TEST_CLEANUP(state); return 0; }