119 lines
3.2 KiB
C
119 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) 2010 Fredrik Johansson
|
||
|
|
|
||
|
|
******************************************************************************/
|
||
|
|
|
||
|
|
#include <stdio.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
#include <limits.h>
|
||
|
|
#include <gmp.h>
|
||
|
|
#include "flint.h"
|
||
|
|
#include "arith.h"
|
||
|
|
#include "ulong_extras.h"
|
||
|
|
#include "profiler.h"
|
||
|
|
|
||
|
|
|
||
|
|
int main(void)
|
||
|
|
{
|
||
|
|
slong i;
|
||
|
|
ulong n;
|
||
|
|
fmpz_t x, y, z;
|
||
|
|
FLINT_TEST_INIT(state);
|
||
|
|
|
||
|
|
flint_printf("euler_phi....");
|
||
|
|
fflush(stdout);
|
||
|
|
|
||
|
|
fmpz_init(x);
|
||
|
|
fmpz_init(y);
|
||
|
|
fmpz_init(z);
|
||
|
|
|
||
|
|
|
||
|
|
for (i = 0; i < 100; i++)
|
||
|
|
{
|
||
|
|
fmpz_set_ui(x, i);
|
||
|
|
arith_euler_phi(y, x);
|
||
|
|
arith_euler_phi(x, x);
|
||
|
|
fmpz_set_ui(z, n_euler_phi(i));
|
||
|
|
if (!fmpz_equal(x, y) || !fmpz_equal(x, z))
|
||
|
|
{
|
||
|
|
flint_printf("FAIL: %wd\n", i);
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Aliasing test */
|
||
|
|
for (i = 0; i < 1000; i++)
|
||
|
|
{
|
||
|
|
fmpz_randtest(x, state, FLINT_BITS);
|
||
|
|
fmpz_randtest(y, state, 5);
|
||
|
|
fmpz_pow_ui(y, y, n_randtest(state) % 100);
|
||
|
|
fmpz_mul(x, x, y);
|
||
|
|
fmpz_set(z, x);
|
||
|
|
arith_euler_phi(y, x);
|
||
|
|
arith_euler_phi(x, x);
|
||
|
|
if (!fmpz_equal(x, y))
|
||
|
|
{
|
||
|
|
flint_printf("FAIL: ");
|
||
|
|
fmpz_print(z);
|
||
|
|
flint_printf("\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Power of a single prime, phi(p^n) = (p-1) * p^(n-1) */
|
||
|
|
for (i = 0; i < 100; i++)
|
||
|
|
{
|
||
|
|
n = (n_randtest(state) % 100) + 1;
|
||
|
|
fmpz_set_ui(x, n_nth_prime(i+1));
|
||
|
|
fmpz_pow_ui(x, x, n);
|
||
|
|
arith_euler_phi(x, x);
|
||
|
|
fmpz_set_ui(y, n_nth_prime(i+1));
|
||
|
|
fmpz_pow_ui(y, y, n-1);
|
||
|
|
fmpz_mul_ui(y, y, n_nth_prime(i+1)-1);
|
||
|
|
if (!fmpz_equal(x, y))
|
||
|
|
{
|
||
|
|
flint_printf("FAIL: %wu ^ %wu\n", n_nth_prime(i+1), n);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Something nontrivial */
|
||
|
|
fmpz_set_str(x, "10426024348053113487152988625265848110501553295256578345594388516660144", 10);
|
||
|
|
fmpz_set_str(y, "2265085829098571747262267425315881590169106756213617459200000000000000", 10);
|
||
|
|
arith_euler_phi(x, x);
|
||
|
|
if (!fmpz_equal(x, y))
|
||
|
|
{
|
||
|
|
flint_printf("FAIL: special test value\n");
|
||
|
|
abort();
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
fmpz_clear(x);
|
||
|
|
fmpz_clear(y);
|
||
|
|
fmpz_clear(z);
|
||
|
|
|
||
|
|
FLINT_TEST_CLEANUP(state);
|
||
|
|
flint_printf("PASS\n");
|
||
|
|
return 0;
|
||
|
|
}
|