[prev in list] [next in list] [prev in thread] [next in thread] 

List:       gmp-devel
Subject:    Jacobi symbol  using Lehmer's algorithm.
From:       nisse () lysator ! liu ! se (Niels =?iso-8859-1?Q?M=F6ller?=)
Date:       2010-02-26 13:08:25
Message-ID: nnhbp416wm.fsf () stalhein ! lysator ! liu ! se
[Download RAW message or body]

nisse at lysator.liu.se (Niels M?ller) writes:

> But the main plan is to use it for testing mpz_jacobi, as a reference
> implementation for the case that b is prime or has a known prime
> factorization.

Now I've added some new tests to tests/mpz/t-jac.c:

  * check_jacobi_factored tests (a/b) where a is random and b has a known
    factorization.

  * check_large_quotients tests (a/b) where the quotient sequence of a
    and b contains large quotients, and b is prime. This test is
    currently disabled, since it's quite slow and involves a prime
    search.

Suggestion on how to make the latter test faster is appreciateed. If all
else fails, it could be enabled by some command line option, and the
default tests could include a few hard-coded inputs if this form.

Regards,
/Niels

-- 
Niels M?ller. PGP-encrypted email is preferred. Keyid C0B98E26.
Internet email is subject to wholesale government surveillance.

[prev in list] [next in list] [prev in thread] [next in thread]