112 lines
3.2 KiB
C
112 lines
3.2 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) 2012 Sebastian Pancratz
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
|
||
|
|
#include "qadic.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
#include "long_extras.h"
|
||
|
|
|
||
|
|
int
|
||
|
|
main(void)
|
||
|
|
{
|
||
|
|
int i, result;
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
|
||
|
|
flint_printf("norm... ");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/* Compare with product of Galois conjugates */
|
||
|
|
for (i = 0; i < 2000; i++)
|
||
|
|
{
|
||
|
|
fmpz_t p;
|
||
|
|
slong d, N;
|
||
|
|
qadic_ctx_t ctx;
|
||
|
|
|
||
|
|
qadic_t a, b, c;
|
||
|
|
padic_t x, y;
|
||
|
|
slong j;
|
||
|
|
int ans;
|
||
|
|
|
||
|
|
fmpz_init_set_ui(p, n_randprime(state, 2 + n_randint(state, 3), 1));
|
||
|
|
d = n_randint(state, 10) + 1;
|
||
|
|
N = z_randint(state, 50) + 1;
|
||
|
|
qadic_ctx_init_conway(ctx, p, d, FLINT_MAX(0,N-10), FLINT_MAX(0,N+10), "a", PADIC_SERIES);
|
||
|
|
|
||
|
|
qadic_init2(a, N);
|
||
|
|
qadic_init2(b, N);
|
||
|
|
qadic_init2(c, N);
|
||
|
|
padic_init2(x, N);
|
||
|
|
padic_init2(y, N);
|
||
|
|
|
||
|
|
qadic_randtest_val(a, state, 0, ctx);
|
||
|
|
qadic_reduce(a, ctx);
|
||
|
|
|
||
|
|
qadic_norm(x, a, ctx);
|
||
|
|
|
||
|
|
qadic_one(b);
|
||
|
|
for (j = 0; j < d; j++)
|
||
|
|
{
|
||
|
|
qadic_frobenius(c, a, j, ctx);
|
||
|
|
qadic_mul(b, b, c, ctx);
|
||
|
|
}
|
||
|
|
ans = qadic_get_padic(y, b, ctx);
|
||
|
|
|
||
|
|
result = (ans && padic_equal(x, y));
|
||
|
|
if (!result)
|
||
|
|
{
|
||
|
|
flint_printf("FAIL:\n\n");
|
||
|
|
flint_printf("a = "), qadic_print_pretty(a, ctx), flint_printf("\n");
|
||
|
|
flint_printf("b = "), qadic_print_pretty(b, ctx), flint_printf("\n");
|
||
|
|
flint_printf("x = "), padic_print(x, &ctx->pctx), flint_printf("\n");
|
||
|
|
flint_printf("y = "), padic_print(y, &ctx->pctx), flint_printf("\n");
|
||
|
|
for (j = 0; j < d; j++)
|
||
|
|
{
|
||
|
|
qadic_frobenius(c, a, j, ctx);
|
||
|
|
flint_printf("sigma^%wd = ", j), qadic_print_pretty(c, ctx), flint_printf("\n");
|
||
|
|
}
|
||
|
|
flint_printf("ans = %d\n", ans);
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
qadic_clear(a);
|
||
|
|
qadic_clear(b);
|
||
|
|
qadic_clear(c);
|
||
|
|
padic_clear(x);
|
||
|
|
padic_clear(y);
|
||
|
|
|
||
|
|
fmpz_clear(p);
|
||
|
|
qadic_ctx_clear(ctx);
|
||
|
|
}
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return EXIT_SUCCESS;
|
||
|
|
}
|
||
|
|
|