/*============================================================================= 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 ******************************************************************************/ #include #include #include #include "flint.h" #include "ulong_extras.h" int main(void) { int i, j, result; ulong count = UWORD(0); FLINT_TEST_INIT(state); flint_printf("factor_pp1...."); fflush(stdout); for (i = 0; i < 300 * flint_test_multiplier(); i++) /* Test random numbers */ { mp_limb_t n1, n2; do { n1 = n_randtest_bits(state, n_randint(state, FLINT_BITS) + 1); } while (n_is_prime(n1) || (n1 < UWORD(2))); for (j = 0; j < 20; j++) { n2 = n_factor_pp1(n1, 1000000, n_randint(state, n1 - 3) + 3); if (n2 > 1) break; } if (n2 > 1) { count++; result = ((n1%n2) == UWORD(0)); if (!result) { flint_printf("FAIL:\n"); flint_printf("n1 = %wu, n2 = %wu\n", n1, n2); abort(); } } } if (count < 295 * flint_test_multiplier()) { flint_printf("FAIL:\n"); flint_printf("Only %wu numbers factored\n", count); abort(); } FLINT_TEST_CLEANUP(state); flint_printf("PASS\n"); return 0; }